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

公开(公告)号：JP2004038928A

公开(公告)日：2004-02-05

申请号：JP2003075430

申请日：2003-03-19

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

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

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

CPC classification number: G06F11/2074 ,  G06F11/1451 ,  G06F11/2066 ,  G06F17/30144 ,  G06F17/30212

Abstract: PROBLEM TO BE SOLVED: To enhance versatility and utility of a snapshot duplication means. SOLUTION: A system and a method are for performing remote asynchronous duplication, namely, mirroring of change of source file system snapshots to a duplicated file system at a destination by identifying a block changed by difference of block volume numbers identified in the case of scanning a logical file block index of each snapshot by utilizing scan (by a scanner) of blocks constituting two versions of snapshots of the source file system. A tree of the block regarding the file is checked, a pointer without changes between versions is bypassed and proceeded downward and changes of hierarchy of trees are identified and the changes are transmitted to a destination mirror, namely, a duplicated snapshot. At the destination, the destination snapshot is updated by using source change. Every deleted or changed inode already existing on the destination is transferred to a temporary directory, namely, "momentary" directory and when it is reused, it is re-linked with the reconstructed duplicated snapshot directory. COPYRIGHT: (C)2004,JPO

公开(公告)号：JP2008269638A

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

申请号：JP2008149382

申请日：2008-06-06

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: PROBLEM TO BE SOLVED: To provide a method and a system capable of maintaining data reliability, capable of deleting logically a failure disk, and capable of minimizing calculation and an access to a disk, for transferring or restoring the data or for executing recalculation of a parity.
SOLUTION: A storage system transfers only a disk block including the allocated data, when the disk is failed (210), and treats an unallocated disk block logically zero when possible. When having no spare disk, a source data block is logically set to zero and the parity is recalculated for the RAID stripe related to the source data block (223). When having a spare, the unallocated block on the spare is logically or physically set to zero when transferred (222). A write operation into the failed disk is re-instructed to other non-failed disks, and a record in a using disk is transferred to the other non-failed disks to be maintained.
COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：提供能够保持数据可靠性的方法和系统，能够逻辑地删除故障盘，并且能够最小化计算和访问磁盘，用于传送或恢复数据或执行 重新计算平价。 解决方案：当磁盘发生故障（210）时，存储系统仅传输包括分配的数据的磁盘块（210），并且尽可能将未分配的磁盘块视为零。 当没有备用磁盘时，源数据块在逻辑上设置为零，并重新计算与源数据块相关的RAID条带的奇偶校验（223）。 当备用时，备用磁盘上的未分配块在传输时逻辑或物理设置为零（222）。 对故障磁盘的写入操作被重新指示给其他非故障磁盘，并且使用磁盘中的记录被传送到要维护的其他未发生故障的磁盘。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2003296038A

公开(公告)日：2003-10-17

申请号：JP2003080010

申请日：2003-03-24

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

Inventor： KLEIMAN STEVEN R ,  SUNDARAM RAJESH ,  DOUCETTE DOUGLAS P ,  STRANGE STEPHEN H ,  VISWANATHAN SRINIVASAN

IPC: G06F3/06 ,  G06F11/10

CPC classification number: G06F3/0613 ,  G06F3/0643 ,  G06F3/0655 ,  G06F3/0689 ,  G06F11/1076

Abstract: PROBLEM TO BE SOLVED: To provide a method for controlling storage of data in a plurality of storage devices, for example, in a RAID array. SOLUTION: This method includes receiving a plurality of write requests associated with data and buffering the write requests. A file system defines a group of storage blocks, responsive to disk topology information. The group includes a plurality of storage blocks in each of the plurality of storage devices. Each data block of the data to be written is associated with a respective one of the storage blocks, for transmitting the association to the plurality of storage devices. COPYRIGHT: (C)2004,JPO

Abstract translation: 要解决的问题：提供一种用于控制例如在RAID阵列中的多个存储设备中的数据存储的方法。 解决方案：该方法包括接收与数据相关联的多个写入请求并缓冲写入请求。 文件系统根据磁盘拓扑信息定义一组存储块。 该组包括多个存储装置中的每一个中的多个存储块。 要写入的数据的每个数据块与相应的一个存储块相关联，用于将关联发送到多个存储设备。 版权所有（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

公开(公告)号：CA2252553C

公开(公告)日：2006-04-25

申请号：CA2252553

申请日：1998-02-27

Applicant: NETWORK APPLIANCE INC

Inventor： KLEIMAN STEVEN R

IPC: G06F11/10

Abstract: The invention provides a method and system for performing XOR operations without consuming substantial computing resources. A specialized processor is coupled to the same bus as a set of disk drives; th e 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 specialized processor maintains an XOR accumulator which is used for XOR operations, whi ch 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 memor y) associates one set of accumulator registers with each selected RAID stripe.

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

公开(公告)号：AT487185T

公开(公告)日：2010-11-15

申请号：AT03251702

申请日：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

公开(公告)号：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系统在写入每个条带时分配块以包含奇偶校验。