摘要:
A mechanism is provided in a data processing system for de-duplication aware secure delete. Responsive to receiving a secure delete request for a file, the mechanism identifies a list of file blocks to be securely deleted from a physical disk device. Responsive to determining at least one virtual block of another file refers to a given disk block corresponding to a file block in the list, the mechanism copies the given disk block to generate a copied disk block in the physical disk device and updates a pointer of the at least one virtual block to refer to the copied disk block. The mechanism writes a secure delete pattern for each file block in the list of file blocks to a disk block in the physical disk device without performing de-duplication processing.
摘要:
Provided are a system, method, and computer program product for controlling access to a shared storage system in communication with at least one cluster of host nodes. Cluster membership metadata is stored in a storage independent from the shared storage for at least one cluster. The cluster membership metadata is updated in response to an inclusion or exclusion request from a requesting host node comprising one of the host nodes identifying at least one other host node to include or exclude from a cluster. Access to at least one storage volume in the shared storage system is managed in response to the updating of the cluster membership metadata for the inclusion or exclusion request.
摘要:
A computer determines a degree of information duplication between at least two files included in an original pre-fetch list. The computer generates a re-ordered pre-fetch list by re-ordering the files included in the original pre-fetch list. The re-ordering is based, at least in part, on the degree of information duplication between the two files included in the original pre-fetch list. The files included in the original pre-fetch list are re-ordered by grouping files containing higher degrees of duplicate information closer together in the re-ordered pre-fetch list.
摘要:
A mechanism is provided for optimizing and enhancing performance for parity based storage, particularly redundant array of independent disk (RAID) storage. The mechanism optimizes a repetitive pattern write command for performance for storage configurations that require parity calculations. The mechanism eliminates the need for laborious parity calculations that are resource intensive and add to IO latency. For repetitive write commands that span across the full stripe of a RAID5 or similar volume, the mechanism calculates parity by looking at the pattern and the number of columns in the volume. The mechanism may avoid the XOR operation altogether for repetitive pattern write commands. The mechanism may enhance secure delete operations that use repetitive pattern write commands by eliminating data reliability operations like parity generation and writing altogether.
摘要:
In one embodiment, a method includes determining a home node that corresponds to gateway (GW) nodes in a clustered file system, each GW node being eligible to process one or more read tasks, determining a peer GW eligibility value for more than one of the GW nodes in the clustered file system eligible to process one or more read tasks, and determining a single GW node from amongst the GW nodes having a highest peer GW eligibility value for each home node. Additionally, the method includes assigning and defining a size for one or more read task items for the GW nodes having the highest peer GW eligibility value for multiple home nodes based on a current dynamic profile of the GW nodes, and distributing workload to the GW nodes according to the size for each of the one or more read task items assigned to the GW nodes.
摘要:
In one embodiment, a method includes determining each gateway (GW) node in a clustered file system eligible to process read tasks and constructing a GW node list of all eligible GW nodes, determining a home node that corresponds to each GW node in the list, creating individual home node GW lists for each home node, with each home node GW list including a set of GW nodes which share a same home node, determining a peer GW eligibility value for each GW node, determining a GW node having a highest eligibility value for each home node, removing all other GW nodes which do not have the highest eligibility value for each home node from the list, assigning and defining a size for read task items for each GW node in the list, and distributing workload to each GW node in the list according to sizes of the read task items.
摘要:
In one embodiment, a method for providing parallel reading in a clustered file system having cache storage includes using an owner gateway node to read data for a fileset, determining whether to utilize other gateway nodes to handle a portion of read traffic for the fileset, selecting a set of eligible gateway nodes based on: a current internal workload, a network workload, and recent performance history data regarding workload distribution across the other gateway nodes, assigning and defining a size for read task items for each gateway node in the set based on a current dynamic profile of each gateway node in the set, providing in-memory and/or input/output resources at each gateway node in the set to handle assigned read task items, and distributing workload to the set of eligible gateway nodes according to the size for the assigned read task items for each gateway node in the set.
摘要:
A mechanism is provided in a data processing system for de-duplication aware secure delete. Responsive to receiving a secure delete request for a file, the mechanism identifies a list of file blocks to be securely deleted from a physical disk device. Responsive to determining at least one virtual block of another file refers to a given disk block corresponding to a file block in the list, the mechanism copies the given disk block to generate a copied disk block in the physical disk device and updates a pointer of the at least one virtual block to refer to the copied disk block. The mechanism writes a secure delete pattern for each file block in the list of file blocks to a disk block in the physical disk device without performing de-duplication processing.
摘要:
A mechanism is provided for optimizing and enhancing performance for parity based storage, particularly redundant array of independent disk (RAID) storage. The mechanism optimizes a repetitive pattern write command for performance for storage configurations that require parity calculations. The mechanism eliminates the need for laborious parity calculations that are resource intensive and add to IO latency. For repetitive write commands that span across the full stripe of a RAID5 or similar volume, the mechanism calculates parity by looking at the pattern and the number of columns in the volume. The mechanism may avoid the XOR operation altogether for repetitive pattern write commands. The mechanism may enhance secure delete operations that use repetitive pattern write commands by eliminating data reliability operations like parity generation and writing altogether.
摘要:
A mechanism is provided for cross-allocated block repair in a mounted file system. A set of cross-allocated blocks are identified from a plurality of blocks within an inode of the mounted file system, based on a corresponding bit associated with each cross-allocated block in a duplicated block information bitmap being in a first identified state. The set of cross-allocated blocks are repaired using a user-defined repair process. Then one or more of the set of cross-allocated blocks are deallocated based on results of the user-defined repair process.