公开(公告)号：US07231412B2

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

申请号：US10637803

申请日：2003-08-08

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F17/30

CPC分类号： G06F3/0643 ,  G06F3/0601 ,  G06F3/0613 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/1076 ,  G06F17/30067 ,  G06F2003/0691 ,  Y10S707/99943 ,  Y10S707/99953 ,  Y10S707/99956

摘要： Integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The present invention uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The present invention writes on the disk with the lowest CWL pointer. A new disk is chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks are defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.

摘要翻译： 将文件系统与导出RAID子系统中数据块布局的精确信息的RAID阵列集成在一起。 本发明对磁盘阵列中的每个磁盘使用单独的电流写入位置（CWL）指针，其中当发生写入时，指针简单地前进通过磁盘。 本发明在具有最低CWL指针的盘上写入。 只有当算法开始为新文件分配空间时，或者在同一个磁盘上为单个文件分配了N个块时，才选择新的磁盘。 足够数量的块被定义为文件中N个顺序缓冲区块中的所有缓冲区。 结果是CWL指针在不同的磁盘上绝对不超过N个块，大文件在同一个磁盘上有N个连续的块。

公开(公告)号：US06289356B1

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

申请号：US09153094

申请日：1998-09-14

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F1200

CPC分类号： G06F11/1435 ,  G06F17/30067 ,  Y10S707/99952 ,  Y10S707/99953

摘要： The present invention provides a method for keeping a file system in a consistent state and for creating read-only copies of a file system. Changes to the file system are tightly controlled. The file system progresses from one self-consistent state to another self-consistent state. The set of self-consistent blocks on disk that is rooted by the root inode is referred to as a consistency point. To implement consistency points, new data is written to unallocated blocks on disk. A new consistency point occurs when the fsinfo block is updated by writing a new root inode for the inode file into it. Thus, as long as the root inode is not updated, the state of the file system represented on disk does not change. The present invention also creates snapshots that are read-only copies of the file system. A snapshot uses no disk space when it is initially created. It is designed so that many different snapshots can be created for the same file system. Unlike prior art file systems that create a clone by duplicating the entire inode file and all of the indirect blocks, the present invention duplicates only the inode that describes the inode file. A multi-bit free-block map file is used to prevent data from being overwritten on disk.

摘要翻译： 本发明提供了一种用于保持文件系统处于一致状态并用于创建文件系统的只读副本的方法。 对文件系统的更改受到严格控制。 文件系统从一个自我一致的状态进展到另一个自我一致的状态。 由根inode根据的磁盘上的一致性块被称为一致性点。 要实现一致性点，新数据将写入磁盘上的未分配块。 当通过为inode文件写入新的根inode来更新fsinfo块时，会发生新的一致性点。 因此，只要root inode不被更新，在磁盘上表示的文件系统的状态就不会改变。 本发明还创建作为文件系统的只读副本的快照。 快照在最初创建时不使用磁盘空间。 它的设计使得可以为同一个文件系统创建许多不同的快照。 与通过复制整个inode文件和所有间接块来创建克隆的现有技术文件系统不同，本发明仅复制描述了inode文件的inode。 多位自由块映射文件用于防止数据在磁盘上被覆盖。

公开(公告)号：US6038570A

公开(公告)日：2000-03-14

申请号：US464591

申请日：1995-05-31

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F3/06 ,  G06F11/10 ,  G06F12/00 ,  G06F17/30

CPC分类号： G06F11/1076 ,  G06F3/0601 ,  G06F3/0613 ,  G06F3/0643 ,  G06F3/0689 ,  G06F2003/0697 ,  Y10S707/99955

摘要： The present invention is a method for integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The file system examines this information and uses it to optimize the location of blocks as they are written to the RAID system. Thus, the system uses explicit knowledge of the underlying RAID disk layout to schedule disk allocation. The present invention uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The algorithm used has two primary goals. The first goal is to keep the CWL pointers as close together as possible, thereby improving RAID efficiency by writing to multiple blocks in the stripe simultaneously. The second goal is to allocate adjacent blocks in a file on the same disk, thereby improving read back performance. The present invention satisfies the first goal by always writing on the disk with the lowest CWL pointer. For the second goal, a new disk is chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks is defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.

摘要翻译： 本发明是用于将文件系统与导出关于RAID子系统中的数据块的布置的精确信息的RAID阵列进行集成的方法。 文件系统检查此信息，并使用它来优化块写入RAID系统时的位置。 因此，系统使用底层RAID磁盘布局的显式知识来计划磁盘分配。 本发明对磁盘阵列中的每个磁盘使用单独的电流写入位置（CWL）指针，其中当发生写入时，指针简单地前进通过磁盘。 所使用的算法有两个主要目标。 第一个目标是使CWL指针尽可能靠近，从而通过同时写入条带中的多个块来提高RAID效​​率。 第二个目标是将文件中的相邻块分配到同一个磁盘上，从而提高回读性能。 本发明通过总是用最低CWL指针在盘上写入来满足第一个目标。 对于第二个目标，只有当算法开始为新文件分配空间时，或者在同一个磁盘上为单个文件分配了N个块时，才选择新的磁盘。 足够数量的块被定义为文件中N个顺序缓冲区块中的所有缓冲区。 结果是CWL指针在不同的磁盘上绝对不超过N个块，大文件在同一个磁盘上有N个连续的块。

公开(公告)号：US06988219B2

公开(公告)日：2006-01-17

申请号：US10233311

申请日：2002-08-28

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F11/00

CPC分类号： G06F11/1076 ,  G06F2211/1059 ,  G06F2211/1061 ,  G11B20/1833

摘要： The present invention is a method for providing error correction for an array of disks using non-volatile random access memory (NV-RAM). Non-volatile RAM is used to increase the speed of RAID recovery from a disk error(s). This is accomplished by keeping a list of all disk blocks for which the parity is possibly inconsistent. Such a list of disk blocks is much smaller than the total number of parity blocks in the RAID subsystem. The total number of parity blocks in the RAID subsystem is typically in the range of hundreds of thousands of parity blocks. Knowledge of the number of parity blocks that are possibly inconsistent makes it possible to fix only those few blocks, identified in the list, in a significantly smaller amount of time than is possible in the prior art. The technique for safely writing to a RAID array with a broken disk is complicated. In this technique, data that can become corrupted is copied into NV-RAM before the potentially corrupting operation is performed.

公开(公告)号：US06721764B2

公开(公告)日：2004-04-13

申请号：US09954522

申请日：2001-09-11

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F1200

CPC分类号： G06F11/1435 ,  G06F17/30067 ,  Y10S707/99952 ,  Y10S707/99953

摘要： The present invention provides a method for keeping a file system in a consistent state and for creating read-only copies of a file system. Changes to the file system are tightly controlled. The file system progresses from one self-consistent state to another self-consistent state. The set of self-consistent blocks on disk that is rooted by the root inode is referred to as a consistency point. To implement consistency points, new data is written to unallocated blocks on disk. A new consistency point occurs when the fsinfo block is updated by writing a new root inode for the inode file into it. Thus, as long as the root inode is not updated, the state of the file system represented on disk does not change. The present invention also creates snapshots that are read-only copies of the file system. A snapshot uses no disk space when it is initially created. It is designed so that many different snapshots can be created for the same file system. Unlike prior art file systems that create a clone by duplicating the entire inode file and all of the indirect blocks, the present invention duplicates only the inode that describes the inode file. A multi-bit free-block map file is used to prevent data from being overwritten on disk.

公开(公告)号：US5963962A

公开(公告)日：1999-10-05

申请号：US108022

申请日：1998-06-30

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F11/14 ,  G06F17/30

CPC分类号： G06F11/1435 ,  G06F17/30067 ,  Y10S707/99952 ,  Y10S707/99953

摘要： The present invention provides a method for keeping a file system in a consistent state and for creating read-only copies of a file system. Changes to the file system are tightly controlled. The file system progresses from one self-consistent state to another self-consistent state. The set of self-consistent blocks on disk that is rooted by the root inode is referred to as a consistency point. To implement consistency points, new data is written to unallocated blocks on disk. A new consistency point occurs when the fsinfo block is updated by writing a new root inode for the inode file into it. Thus, as long as the root inode is not updated, the state of the file system represented on disk does not change. The present invention also creates snapshots that are read-only copies of the file system. A snapshot uses no disk space when it is initially created. It is designed so that many different snapshots can be created for the same file system. Unlike prior art file systems that create a clone by duplicating the entire inode file and all of the indirect blocks, the present invention duplicates only the inode that describes the inode file. A multi-bit free-block map file is used to prevent data from being overwritten on disk.

公开(公告)号：US08359334B2

公开(公告)日：2013-01-22

申请号：US12896779

申请日：2010-10-01

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F3/0643 ,  G06F3/0601 ,  G06F3/0613 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/1076 ,  G06F17/30067 ,  G06F2003/0691 ,  Y10S707/99943 ,  Y10S707/99953 ,  Y10S707/99956

摘要： Integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The present invention uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The present invention writes on the disk with the lowest CWL pointer. A new disk is chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks are defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.

摘要翻译： 将文件系统与导出RAID子系统中数据块布局的精确信息的RAID阵列集成在一起。 本发明对磁盘阵列中的每个磁盘使用单独的电流写入位置（CWL）指针，其中当发生写入时，指针简单地前进通过磁盘。 本发明在具有最低CWL指针的盘上写入。 只有当算法开始为新文件分配空间时，或者在同一个磁盘上为单个文件分配了N个块时，才选择新的磁盘。 足够数量的块被定义为文件中N个顺序缓冲区块中的所有缓冲区。 结果是CWL指针在不同的磁盘上绝对不超过N个块，大文件在同一个磁盘上有N个连续的块。

公开(公告)号：US07174352B2

公开(公告)日：2007-02-06

申请号：US09854187

申请日：2001-05-10

申请人： Steven R. Kleiman ,  David Hitz ,  Guy Harris ,  Sean W. O'Malley ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： Steven R. Kleiman ,  David Hitz ,  Guy Harris ,  Sean W. O'Malley ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F17/00

CPC分类号： G06F11/1451 ,  G06F11/1435 ,  G06F17/30067 ,  Y10S707/99953 ,  Y10S707/99954

摘要： The invention provides a method and system for duplicating all or part of a file system while maintaining consistent copies of the file system. The file server maintains a set of snapshots, each indicating a set of storage blocks making up a consistent copy of the file system as it was at a known time. Each snapshot can be used for a purpose other than maintaining the coherency of the file system, such as duplicating or transferring a backup copy of the file system to a destination storage medium. In a preferred embodiment, the snapshots can be manipulated to identify sets of storage blocks in the file system for incremental backup or copying, or to provide a file system backup that is both complete and relatively inexpensive. Also in a preferred embodiment, shadow snapshots can be maintained, with a shadow snapshot including a set of member storage blocks that formed a consistent file system other than an active file system, with a set of selected member storage blocks removed from the consistent file system.

摘要翻译： 本发明提供了一种用于在保持文件系统的一致副本的同时复制文件系统的全部或部分的方法和系统。 文件服务器维护一组快照，每个快照指示一组存储块，构成文件系统的一致副本，就像在已知时间一样。 每个快照可以用于维护文件系统的一致性之外的目的，例如将文件系统的备份副本复制或传送到目的地存储介质。 在优选实施例中，可以操纵快照以识别用于增量备份或复制的文件系统中的存储块集合，或提供完整且相对便宜的文件系统备份。 同样在优选实施例中，可以维护影子快照，其中，影子快照包括一组成员存储块，其形成除活动文件系统之外的一致的文件系统，并且从一致的文件系统中移除了一组选定的成员存储块 。

公开(公告)号：US06751637B1

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

申请号：US09624753

申请日：2000-07-24

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F1730

CPC分类号： G06F3/0643 ,  G06F3/0601 ,  G06F3/0613 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/1076 ,  G06F17/30067 ,  G06F2003/0691 ,  Y10S707/99943 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A is a method is disclosed for integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The file system examines this information and uses it to optimize the location of blocks as they are written to the RAID system. Thus, the system uses explicit knowledge of the underlying RAID disk layout to schedule disk allocation. The method uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The algorithm used has two primary goals. The first goal is to keep the CWL pointers as close together as possible, thereby improving RAID efficiency by writing to multiple blocks in the stripe simultaneously. The second goal is to allocate adjacent blocks in a file on the same disk, thereby improving read back performance. The method satisfies the first goal by always writing on the disk with the lowest CWL pointer. For the second goal, a new disks chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks is defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.

摘要翻译： A公开了一种用于将文件系统与导出关于RAID子系统中的数据块的布置的精确信息的RAID阵列集成的方法。 文件系统检查此信息，并使用它来优化块写入RAID系统时的位置。 因此，系统使用底层RAID磁盘布局的显式知识来计划磁盘分配。 该方法为磁盘阵列中的每个磁盘使用单独的当前写入位置（CWL）指针，其中当发生写入时，指针简单地通过磁盘。 所使用的算法有两个主要目标。 第一个目标是使CWL指针尽可能靠近，从而通过同时写入条带中的多个块来提高RAID效​​率。 第二个目标是将文件中的相邻块分配到同一个磁盘上，从而提高回读性能。 该方法通过始终使用最低CWL指针在磁盘上写入来满足第一个目标。 对于第二个目标，只有当算法开始为新文件分配空间时，或者在同一个磁盘上为单个文件分配了N个块时才选择新的磁盘。 足够数量的块被定义为文件中N个顺序缓冲区块中的所有缓冲区。 结果是CWL指针在不同的磁盘上绝对不超过N个块，大文件在同一个磁盘上有N个连续的块。

公开(公告)号：US6138126A

公开(公告)日：2000-10-24

申请号：US359168

申请日：1999-07-21

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F3/06 ,  G06F12/00 ,  G06F17/00 ,  G06F17/30

CPC分类号： G06F3/0643 ,  G06F11/1076 ,  G06F17/30067 ,  G06F3/0613 ,  G06F3/064 ,  G06F3/0689 ,  G06F2003/0691 ,  G06F3/0601 ,  Y10S707/99943 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A method is disclosed for integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The file system examines this information and uses it to optimize the location of blocks as they are written to the RAID system. Thus, the system uses explicit knowledge of the underlying RAID disk layout to schedule disk allocation. The method uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The algorithm used has two primary goals. The first goal is to keep the CWL pointers as close together as possible, thereby improving RAID efficiency by writing to multiple blocks in the stripe simultaneously. The second goal is to allocate adjacent blocks in a file on the same disk, thereby improving read back performance. The method satisfies the first goal by always writing on the disk with the lowest CWL pointer. For the second goal, a new disks chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks is defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.

摘要翻译： 公开了一种用于将文件系统与导出关于RAID子系统中的数据块的布置的精确信息的RAID阵列集成的方法。 文件系统检查此信息，并使用它来优化块写入RAID系统时的位置。 因此，系统使用底层RAID磁盘布局的显式知识来计划磁盘分配。 该方法为磁盘阵列中的每个磁盘使用单独的当前写入位置（CWL）指针，其中当发生写入时，指针简单地通过磁盘。 所使用的算法有两个主要目标。 第一个目标是使CWL指针尽可能靠近，从而通过同时写入条带中的多个块来提高RAID效​​率。 第二个目标是将文件中的相邻块分配到同一个磁盘上，从而提高回读性能。 该方法通过始终使用最低CWL指针在磁盘上写入来满足第一个目标。 对于第二个目标，只有当算法开始为新文件分配空间时，或者在同一个磁盘上为单个文件分配了N个块时才选择新的磁盘。 足够数量的块被定义为文件中N个顺序缓冲区块中的所有缓冲区。 结果是CWL指针在不同的磁盘上绝对不超过N个块，大文件在同一个磁盘上有N个连续的块。