公开(公告)号：JP2003233468A

公开(公告)日：2003-08-22

申请号：JP2002379362

申请日：2002-12-27

Applicant: NETWORK APPLIANCE INC

Inventor： CORBETT PETER F ,  KLEIMAN STEVEN R ,  ENGLISH ROBERT M

IPC: G06F3/06 ,  G06F11/10

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

公开(公告)号：JP2004030577A

公开(公告)日：2004-01-29

申请号：JP2003062749

申请日：2003-03-10

Applicant: Network Appliance Inc ,  ネットワーク・アプライアンス・インコーポレイテッド

Inventor： KLEIMAN STEVEN R ,  ENGLISH ROBERT M ,  CORBETT PETER F

IPC: G06F3/06 ,  G06F11/10

CPC classification number: G06F11/1076

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

公开(公告)号：JP2003233469A

公开(公告)日：2003-08-22

申请号：JP2002379363

申请日：2002-12-27

Applicant: NETWORK APPLIANCE INC

Inventor： ENGLISH ROBERT M ,  CORBETT PETER F ,  KLEIMAN STEVEN R

IPC: G06F3/06 ,  G06F11/10

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

公开(公告)号：AU2004294208B2

公开(公告)日：2009-06-11

申请号：AU2004294208

申请日：2004-11-24

Applicant: NETWORK APPLIANCE INC

Inventor： ENGLISH ROBERT M ,  CORBETT PETER F ,  KLEIMAN STEVEN R

IPC: G06F11/10

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.

公开(公告)号：CA2546242A1

公开(公告)日：2005-06-09

申请号：CA2546242

申请日：2004-11-24

Applicant: NETWORK APPLIANCE INC

Inventor： CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

IPC: G06F3/06 ,  G06F11/10

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.

公开(公告)号：CA2546242C

公开(公告)日：2011-07-26

申请号：CA2546242

申请日：2004-11-24

Applicant: NETWORK APPLIANCE INC

Inventor： CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

IPC: G06F3/06 ,  G06F11/10

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.

公开(公告)号：WO2005043378A3

公开(公告)日：2008-06-12

申请号：PCT/US2004036343

申请日：2004-11-01

Applicant: NETWORK APPLIANCE INC ,  KLEIMAN STEVEN R ,  ENGLISH ROBERT M ,  CORBETT PETER F

Inventor： KLEIMAN STEVEN R ,  ENGLISH ROBERT M ,  CORBETT PETER F

IPC: G06F11/10 ,  G06F3/06 ,  G06F12/16

CPC classification number: G06F11/1076 ,  G06F11/1088

Abstract: A dynamic parity distribution system and technique distributes parity across disks of an array. The dynamic parity distribution system includes a storage operating system that integrates a file system with a RAID system. In response to a request to store (write) data on the array, the file system determines which disks contain free blocks in a next allocated stripe of the array. There may be multiple blocks within the stripe that do not contain file system data (i.e., unallocated data blocks) and that could potentially store parity. One or more of those unallocated data blocks can be assigned to store parity, arbitrarily. According to the dynamic parity distribution technique, the file system determines which blocks hold parity each time there is a write request to the stripe. The technique alternately allows the RAID system to assign a block to contain parity when each stripe is written.

Abstract translation: 动态奇偶校验分配系统和技术在阵列的磁盘上分配奇偶校验。 动态奇偶校验分配系统包括将文件系统与RAID系统集成的存储操作系统。 响应于在阵列上存储（写入）数据的请求，文件系统确定哪个磁盘在数组的下一个分配的条带中包含空闲块。 条带内可能存在不包含文件系统数据（即，未分配的数据块）并且可能存储奇偶校验的多个块。 这些未分配数据块中的一个或多个可以被任意地分配给存储奇偶校验。 根据动态奇偶校验分配技术，文件系统确定哪个块在每次存在针对条带的写入请求时保持奇偶校验。 该技术交替地允许RAID系统在写入每个条带时分配块以包含奇偶校验。

公开(公告)号：WO2007078803A3

公开(公告)日：2009-05-07

申请号：PCT/US2006047647

申请日：2006-12-14

Applicant: NETWORK APPLIANCE INC ,  CORBETT PETER F ,  GOEL ATUL

Inventor： CORBETT PETER F ,  GOEL ATUL

IPC: G06F3/06 ,  G06F11/10

CPC classification number: G06F11/1076 ,  G06F2211/1061

Abstract: A triple parity (TP) technique reduces overhead of computing diagonal and anti- diagonal parity for a storage array adapted to enable efficient recovery from the concurrent failure of three storage devices in the array. The diagonal parity is computed 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. Similarly, the anti-diagonal parity is computed along anti-diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the anti-diagonal parity sets except one is stored on the anti-diagonal parity disk. The TP technique provides a uniform stripe depth and an optimal amount of parity information.

Abstract translation: 三重奇偶校验（TP）技术减少了针对阵列中的三个存储设备的并发故障进行有效恢复的存储阵列计算对角线和反对角奇偶校验的开销。 沿对角线奇偶校验集计算对角线奇偶校验集，该集合跨越阵列的所有数据磁盘和行奇偶校验磁盘。 所有对角奇偶校验集的奇偶校验除了一个存储在对角奇偶校验磁盘上。 类似地，反对角奇偶校验是沿着反对角奇偶校验集计算的，它们共同跨越阵列的所有数据盘和行奇偶校验盘。 所有反对角奇偶校验集的奇偶校验除了一个存储在反对角奇偶校验磁盘上。 TP技术提供均匀条纹深度和最优量的奇偶校验信息。

公开(公告)号：IL175829A

公开(公告)日：2010-12-30

申请号：IL17582906

申请日：2006-05-22

Applicant: NETWORK APPLIANCE INC ,  CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

Inventor： CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

IPC: G06F11/10

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.

公开(公告)号：AU2004294208A1

公开(公告)日：2005-06-09

申请号：AU2004294208

申请日：2004-11-24

Applicant: NETWORK APPLIANCE INC

Inventor： ENGLISH ROBERT M ,  CORBETT PETER F ,  KLEIMAN STEVEN R

IPC: G06F11/10

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.