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

公开(公告)号：JP2004038932A

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

申请号：JP2003080011

申请日：2003-03-24

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

Inventor： LEONG JAMES ,  SUNDARAM RAJESH ,  DOUCETTE DOUGLAS P ,  SCHOENTHAL SCOTT ,  STRANGE STEPHEN H ,  VISWANATHAN SRINIVASAN

IPC: G06F3/06 ,  G06F9/00 ,  G06F11/20

CPC classification number: G06F3/0601 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0655 ,  G06F3/0659 ,  G06F3/0689 ,  G06F9/4881 ,  G06F11/2087

Abstract: PROBLEM TO BE SOLVED: To implement an I/O task architecture in which a data access request (for example, stripe writing) is decomposed into a plurality of independently schedulable lower-level synchronous I/O tasks. SOLUTION: Resources needed by lower-level I/O tasks are dynamically assigned, as needed, for effective load and resource use balance to thereby achieve high scalability. A hierarchical order is assigned to the I/O tasks to ensure that there is a forward progression of their higher-level I/O task and to ensure that resources do not become deadlocked. COPYRIGHT: (C)2004,JPO

公开(公告)号：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文件系统维护的一致性点号码快速确定哪个是最新的 本发明快速成对地确定响应于在每个镜像卷保持的文件系统的快照，在最新的最新镜像卷和每个其他镜像卷之间共享哪些块，并且共同成对存储在每个镜像卷之间 每个镜像卷和最新的镜像卷。本发明仅重新同步在公共快照和最新的快照之间已经更改的块。

公开(公告)号：WO03009286A3

公开(公告)日：2003-09-12

申请号：PCT/US0151321

申请日：2001-10-25

Applicant: NETWORK APPLIANCE INC

Inventor： KAHN ANDY ,  SUNDARAM RAJESH ,  VISWANATHAN SRINIVASAN ,  KLEIMAN STEVEN R

IPC: G06F11/10 ,  G11B20/18 ,  H03M13/09

CPC classification number: G06F11/1076 ,  G11B20/18 ,  H03M13/096

Abstract: A method and apparatus for a reliable data storage system using block level checksums appended to data blocks. Files are stored on hard disks in storage blocks, including data blocks and block-appended checksums. The block-appended checksum includes a checksum of the data block, a VBN, a DBN, and an embedded checksum for checking the integrity of the block-appended checksum itself. A file system includes file blocks with associated block-appended checksum to the data blocks. The file blocks with block-appended checksums are written to storage blocks. In a preferred embodiment a collection of disk drives are formatted with 520 bytes of data per sector. For each 4,096-byte file block, a corresponding 64-byte block-appended checksum is appended to the file block with the first 7 sectors including most of the file block data while the 8th sector includes the remaining file block data and the 64-byte block-appended checksum.

Abstract translation: 一种使用附加到数据块的块级校验和的可靠数据存储系统的方法和装置。 文件存储在存储块中的硬盘上，包括数据块和块附加校验和。 块附加的校验和包括数据块的校验和，VBN，DBN和用于检查块附加校验和本身的完整性的嵌入校验和。 文件系统包括具有与数据块相关联的块附加校验和的文件块。 具有块附加校验和的文件块被写入存储块。 在优选实施例中，磁盘驱动器的集合被格式化为每扇区520字节的数据。 对于每个4,096字节的文件块，相应的64字节的块附加校验和被附加到文件块，前7个扇区包括大部分文件块数据，而第8个扇区包括剩余的文件块数据和64字节 块附加校验和。

公开(公告)号：WO0229573B1

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

申请号：PCT/US0125763

申请日：2001-08-17

Applicant: NETWORK APPLIANCE INC

Inventor： LEWIS BLAKE ,  EDWARDS JOHN K ,  VISWANATHAN SRINIVASAN

IPC: G06F11/14

CPC classification number: G06F11/14 ,  G06F11/1435 ,  G06F2201/84 ,  Y10S707/99931 ,  Y10S707/99956

Abstract: The invention provides an improved method and apparatus for creating a snapshot of a file system. In a first aspect of the invention, a "copy-on-write" mechanism is used. An effective snapshot mechanism must be efficient both in its use of storage space and in the time needed to create it because file systems are often large. The snapshot uses the same blocks as the active file system until the active file system is modified. Whenever a modification occurs, the modified data is copied to a new block and the old data is saved (henceforth called "copy-on-write". In this way, the snapshot only uses space where it differs from the active file system, and the amount of work required to create the snapshot is small. In a second aspect of the invention, a record of which blocks are being used by the snapshot is included in the snapshot itself, allowing effectively instantaneous snapshot creation and deletion.

Abstract translation: 本发明提供了一种用于创建文件系统的快照的改进的方法和装置。 在本发明的第一方面中，使用“写时复制”机制。 有效的快照机制在使用存储空间以及创建时所需的时间必须要高效，因为文件系统通常很大。 快照使用与活动文件系统相同的块，直到活动文件系统被修改为止。 每当修改发生时，修改的数据被复制到新的块，并且保存旧数据（以下称为“写时复制”，这样，快照只使用与活动文件系统不同的空间， 创建快照所需的工作量很小。在本发明的第二方面，快照中使用哪些块的记录被包括在快照本身中，从而有效地即时创建和删除快照。

公开(公告)号：WO0229572B1

公开(公告)日：2003-04-24

申请号：PCT/US0131422

申请日：2001-10-04

Applicant: NETWORK APPLIANCE INC

Inventor： VISWANATHAN SRINIVASAN ,  KLEIMAN STEVEN R

IPC: G06F11/14 ,  G06F11/20

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文件系统维护的一致性点号码快速确定哪个是最新的 本发明快速成对地确定响应于在每个镜像卷保持的文件系统的快照，在最新的最新镜像卷和每个其他镜像卷之间共享哪些块，并且共同成对存储在每个镜像卷之间 每个镜像卷和最新的镜像卷。本发明仅重新同步在公共快照和最新的快照之间已经更改的块。

公开(公告)号：DE60144333D1

公开(公告)日：2011-05-12

申请号：DE60144333

申请日：2001-08-17

Applicant: NETWORK APPLIANCE INC

Inventor： LEWIS BLAKE ,  EDWARDS JOHN K ,  VISWANATHAN SRINIVASAN

IPC: G06F11/14

公开(公告)号：DE60112462T2

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

申请号：DE60112462

申请日：2001-10-04

Applicant: NETWORK APPLIANCE INC

Inventor： VISWANATHAN SRINIVASAN ,  KLEIMAN R

IPC: G06F11/20 ,  G06F11/14

公开(公告)号：DE60112462D1

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

申请号：DE60112462

申请日：2001-10-04

Applicant: NETWORK APPLIANCE INC

Inventor： VISWANATHAN SRINIVASAN ,  KLEIMAN R

IPC: G06F11/14 ,  G06F11/20

公开(公告)号：WO0229572A9

公开(公告)日：2003-11-13

申请号：PCT/US0131422

申请日：2001-10-04

Applicant: NETWORK APPLIANCE INC

Inventor： VISWANATHAN SRINIVASAN ,  KLEIMAN STEVEN R

IPC: G06F11/14 ,  G06F11/20

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.