公开(公告)号：WO2005052855A3

公开(公告)日：2007-05-31

申请号：PCT/US2004039518

申请日：2004-11-24

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 ,  G11B20/18

CPC classification number: G06F11/1076 ,  G06F2211/1057

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).

Abstract translation: 统一和对称的双故障校正技术可保护存储系统的磁盘阵列中的两个或更少磁盘故障。 存储系统的RAID系统生成两个用于存储在阵列中的“冗余”信息的磁盘，其中冗余信息（例如，奇偶校验）从两个对角奇偶校验集（“对角线”）和行奇偶校验集 （ “行”）。 具体来说，RAID系统沿着阵列的行和阵列的对角线对角线奇偶校验来计算行奇偶校验。 然而，冗余（奇偶校验）信息磁盘的内容相互作用，使得两个磁盘都不包含纯（单独）对角线或行冗余信息; 使用行奇偶校验计算中的对角奇偶校验结果生成冗余信息（反之亦然）。

公开(公告)号：WO2006118957A2

公开(公告)日：2006-11-09

申请号：PCT/US2006016055

申请日：2006-04-27

Applicant: NETWORK APPLIANCE INC

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

IPC: G06F3/06 ,  G06F11/10

CPC classification number: G06F11/1096 ,  G06F3/0607 ,  G06F3/0632 ,  G06F3/0646 ,  G06F3/0689

Abstract: A technique places content, such as data, of one or more data containers on volumes of a striped volume set (SVS). The placement of data across the volumes of the SVS allows specification of a deterministic pattern of fixed length. That is, the pattern determines a placement of data of a data container that is striped among the volumes of the SVS. The placement pattern is such that the stripes are distributed exactly or nearly equally among the volumes and that, within any local span of a small multiple of the number of volumes, the stripes are distributed nearly equally among the volumes. The placement pattern is also substantially similar for a plurality of SVSs having different numbers of volumes.

Abstract translation: 一种技术将一个或多个数据容器的内容（如数据）放置在条带卷集（SVS）的卷上。 数据在SVS卷上的放置允许规定固定长度的确定性模式。 也就是说，该模式确定在SVS的卷之间条带化的数据容器的数据的放置。 放置图案使得条纹在卷之间精确地或几乎相等地分布，并且在卷的数量的小倍数的任何局部范围内，条纹在卷之间几乎相等地分布。 对于具有不同数量的体积的多个SVS，放置图案也基本相似。

公开(公告)号：WO0229572A2

公开(公告)日：2002-04-11

申请号：PCT/US0131422

申请日：2001-10-04

Applicant: NETWORK APPLIANCE INC

Inventor： VISWANATHAN SRINIVASAN ,  KLEIMAN STEVEN R

IPC: G06F11/14 ,  G06F11/20 ,  G06F11/00

CPC classification number: G06F11/2082 ,  G06F11/1471 ,  G06F11/2064 ,  Y10S707/99953 ,  Y10S707/99955

Abstract: The invention provides a method and system for recovery of file system data in file servers having mirrored file system volumes. The invention makes use of a "snapshot" feature of a robust file system (the "WAFL File System) to rapidly determine which of two or more mirrored volumes is most up-to-date, and which file blocks of the most recent mirrored volume have been changed from each one of the mirrored file systems. In a preferred embodiment, among a plurality of mirrored volumes, the invention rapidly determines which is the most up-to-date by examining a consistency point number maintained by the WAFL File System at each mirrored volume. The invention rapidly pairwise determines what blocks are shared between that most up-to-date mirrored volume and each other mirrored volume, in response to a snapshot of the file system maintained at each mirrored volume and are stored in common pairwise between each mirrored volume and the most up-to-date mirrored volume. The invention re synchronizes only those blocks that have been changed between the common snapshot and the most up-to-date snapshot.

Abstract translation: 本发明提供了一种用于在具有镜像文件系统卷的文件服务器中恢复文件系统数据的方法和系统。 本发明利用鲁棒文件系统（“WAFL文件系统”）的“快照”特征来快速确定两个或多个镜像卷中的哪一个是最新的，以及最新的镜像卷的哪些文件块 在一个优选实施例中，在多个镜像卷中，本发明通过检查由WAFL文件系统维护的一致性点号码快速确定哪个是最新的 本发明快速成对地确定响应于在每个镜像卷保持的文件系统的快照，在最新的最新镜像卷和每个其他镜像卷之间共享哪些块，并且共同成对存储在每个镜像卷之间 每个镜像卷和最新的镜像卷。本发明仅重新同步在公共快照和最新的快照之间已经更改的块。

公开(公告)号：DE60334752D1

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

申请号：DE60334752

申请日：2003-03-19

Applicant: NETWORK APPLIANCE INC

Inventor： FEDERWISCH MICHAEL L ,  MANLEY STEPHEN L ,  OWARA SHANE S ,  KLEIMAN STEVEN R

IPC: G06F3/06 ,  G06F17/30 ,  G06F11/14 ,  G06F11/20 ,  G06F12/00

公开(公告)号：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.

公开(公告)号：AU2003278864A1

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

申请号：AU2003278864

申请日：2003-06-24

Applicant: NETWORK APPLIANCE INC

Inventor： KLEIMAN STEVEN R ,  STRANGE STEPHEN H

IPC: G06F3/06 ,  G06F11/00 ,  G06F11/10 ,  G06F11/20 ,  H02H3/05

Abstract: On disk failure, the storage system migrates only those disk blocks that included allocated data, and treats unallocated disk blocks as being logically zero when possible. When there is no spare disk, the source data block is logically set to zero and parity is recalculated for the RAID stripe associated with the source data block. When there is a spare, unallocated blocks on the spare are logically or physically set to zero upon migration. Write operations for the failed disk are redirected to other non-failing disks, and a record of which in-use disk blocks have been thus "migrated" to those other non-failing disks in maintained. Unused disk blocks are proactively set to zero. A target mirror copy is created using information regarding allocated disk blocks, by copying those blocks including allocated data or parity, and by clearing at the mirror those blocks not including any allocated data or parity.

公开(公告)号：AT240551T

公开(公告)日：2003-05-15

申请号：AT98908761

申请日：1998-02-27

Applicant: NETWORK APPLIANCE INC

Inventor： KLEIMAN STEVEN R

IPC: G06F3/06 ,  G06F11/10 ,  G11B20/18

Abstract: The invention provides a method and system for performing XOR operations without consuming substantial computing resources. A specialised processor is coupled to the same bus as a set of disk drives; the specialized processor reviews data transfers to and from the disk drives and performs XOR operations on data transferred to and from the disk drives without requiring separate transfers. The specialised processor maintains an XOR accumulator which is used for XOR operations, which records the result of XOR operations, and which is read out upon command of the processor. The XOR accumulator includes one set of accumulator registers for each RAID stripe, for a selected set of RAID stripes. A memory (such as a contents-addressable memory) associates one set of accumulator registers with each selected RAID stripe.

公开(公告)号：AU6671098A

公开(公告)日：1998-09-18

申请号：AU6671098

申请日：1998-02-27

Applicant: NETWORK APPLIANCE INC

Inventor： KLEIMAN STEVEN R

IPC: G06F3/06 ,  G06F11/10 ,  G11B20/18

Abstract: The invention provides a method and system for performing XOR operations without consuming substantial computing resources. A specialised processor is coupled to the same bus as a set of disk drives; the specialized processor reviews data transfers to and from the disk drives and performs XOR operations on data transferred to and from the disk drives without requiring separate transfers. The specialised processor maintains an XOR accumulator which is used for XOR operations, which records the result of XOR operations, and which is read out upon command of the processor. The XOR accumulator includes one set of accumulator registers for each RAID stripe, for a selected set of RAID stripes. A memory (such as a contents-addressable memory) associates one set of accumulator registers with each selected RAID stripe.

公开(公告)号：EP1535154A4

公开(公告)日：2008-09-10

申请号：EP03742221

申请日：2003-06-24

Applicant: NETWORK APPLIANCE INC

Inventor： KLEIMAN STEVEN R ,  STRANGE STEPHEN H

IPC: G06F3/06 ,  G06F11/00 ,  G06F11/10 ,  G06F11/20 ,  H02H3/05

CPC classification number: G06F11/1662 ,  G06F11/1092 ,  G06F11/2082 ,  G06F11/2094

Abstract: On disk failure (210), the storage system migrates only those disk blocks that included allocated data, and treats unallocated disk blocks as being logically zero when possible. When there is no spare disk, the source disk block is logically set to zero and parity is recalculated for the RAID stripe associated with the source disk block (223). When there is a spare, unallocated blocks on the spare are logically or physically set to zero upon migration (222). Write operations for the failed disk are redirected to other non-failing disks, and a record of which in-use disk blocks have been thus 'migrated' to those other non-failing disks in maintained. Unused disk blocks are proactively set to zero. A target mirror copy is created using information regarding allocated disk blocks, by copying those blocks including allocated data or parity, and by clearing at the mirror those blocks not including any allocated.