Abstract:
PROBLEM TO BE SOLVED: To provide a technique for efficiently reconstructing any one or combination of two failing storage devices of a storage array. SOLUTION: A 'row - diagonal' (R-D) parity technique, which reduces overhead of computing diagonal parity for a storage array, computes the diagonal parity along diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the diagonal parity sets except one is stored on the diagonal parity disk. The R-D parity technique provides a uniform stripe depth and an optimal amount of parity information required for recovering from failures of two storage devices. COPYRIGHT: (C)2003,JPO
Abstract:
PROBLEM TO BE SOLVED: To provide a method to effectively restore data in the event of failure of two arbitrary storage devices. SOLUTION: A main storage array comprises a plurality of connected sub-arrays, each of which comprises an assembly of data storage devices and a local parity storage device to store a value to be used for correcting a failure of a unitary device in a row of a block of the sub-array (eg. a row parity group). To each sub-array, a diagonal parity group is allocated as if it had been the only existence using a method of encoding for protecting against double failure. The main array further comprises a global diagonal parity storage device that holds a diagonal parity calculated by adding an equal diagonal parity group logically in a lump at each of the sub-arrays. COPYRIGHT: (C)2004,JPO
Abstract:
PROBLEM TO BE SOLVED: To provide a technique for efficiently reconstructing any one or combination of two failing storage devices of a storage array. SOLUTION: A storage array comprises a plurality of concatenated sub-array, wherein each sub-array includes a set of data storage devices and a parity storage device. Each row parity group is associated with a sub-array of the array. The array further includes a global parity storage device holding diagonal parity computed across the concatenation of the sub-arrays. Instead of requiring that each parity group contains both a row parity device and a diagonal parity device, the array is composed of a collection of row parity group. Diagonal parity is calculated across the fully array. COPYRIGHT: (C)2003,JPO
Abstract:
A semi-static distribution technique distributes parity across disks of an array. According to the technique, parity is distributed (assigned) across t he disks of the array in a manner that maintains a fixed pattern of parity bloc ks among the stripes of the disks. When one or more disks are added to the arra y, the semi-static technique redistributes parity in a way that does not requir e recalculation of parity or moving of any data blocks. Notably, the parity information is not actually moved; the technique merely involves a change in the assignment (or reservation) for some of the parity blocks of each pre- existing disk to the newly added disk.
Abstract:
A semi-static distribution technique distributes parity across disks of an array. According to the technique, parity is distributed (assigned) across the disks of the array in a manner that maintains a fixed pattern of parity blocks among the stripes of the disks. When one or more disks are added to the array, the semi-static technique redistributes parity in a way that does not require recalculation of parity or moving of any data blocks. Notably, the parity information is not actually moved; the technique merely involves a change in the assignment (or reservation) for some of the parity blocks of each pre-existing disk to the newly added disk.
Abstract:
A network caching system has a multi-protocol caching filer coupled to an origin server to provide storage virtualization of data served by the filer in response to data access requests issued by multi-protocol clients over a computer network. The multi-protocol caching filer includes a file system configured to manage a sparse volume that “virtualizes” a storage space of the data to thereby provide a cache function that enables access to data by the multi-protocol clients. To that end, the caching filer further includes a multi-protocol engine configured to translate the multi-protocol client data access requests into generic file system primitive operations executable by both the caching filer and the origin server.
Abstract:
A semi-static distribution technique distributes parity across disks of an array. According to the technique, parity is distributed (assigned) across the disks of the array in a manner that maintains a fixed pattern of parity blocks among the stripes of the disks. When one or more disks are added to the array, the semi-static technique redistributes parity in a way that does not require recalculation of parity or moving of any data blocks. Notably, the parity information is not actually moved; the technique merely involves a change in the assignment (or reservation) for some of the parity blocks of each pre-existing disk to the newly added disk.
Abstract:
A semi-static distribution technique distributes parity across disks of an array. According to the technique, parity is distributed (assigned) across the disks of the array in a manner that maintains a fixed pattern of parity blocks among the stripes of the disks. When one or more disks are added to the array, the semi-static technique redistributes parity in a way that does not require recalculation of parity or moving of any data blocks. Notably, the parity information is not actually moved; the technique merely involves a change in the assignment (or reservation) for some of the parity blocks of each pre-existing disk to the newly added disk.
Abstract:
A uniform and symmetric, double failure-correcting technique protects against two or fewer disk failures in a disk array of a storage system. A RAID system of the storage system generates two disks worth of "redundant" information for storage in the array, wherein the redundant information (e.g., parity) is illustratively derived from computations along both diagonal parity sets ("diagonals") and row parity sets ("rows"). Specifically, the RAID system computes row parity along rows of the array and diagonal parity along diagonals of the array. However, the contents of the redundant (parity) information disks interact such that neither disk contains purely (solely) diagonal or row redundancy information; the redundant information is generated using diagonal parity results in row parity computations (and vice versa).