公开(公告)号：US08443153B1

公开(公告)日：2013-05-14

申请号：US12683385

申请日：2010-01-06

Applicant: John K. Edwards ,  Keith A. Smith ,  Jiri Schindler ,  Steven R. Kleiman

Inventor： John K. Edwards ,  Keith A. Smith ,  Jiri Schindler ,  Steven R. Kleiman

IPC: G06F12/00

CPC classification number: G06F17/30091 ,  G06F3/0611 ,  G06F3/064 ,  G06F3/067 ,  G06F11/1076

Abstract: A storage system provides highly flexible data layouts that can be tailored to various different applications and use cases. The system dynamically balances performance with block sharing, based on service level objectives (SLOs). The system defines several types of data containers, including “regions”, “logical extents” and “slabs”. Each region includes one or more logical extents. Allocated to each logical extent is at least part of one or more slabs allocated to the region that includes the extent. Each slab is a set of blocks of storage from one or more physical storage devices. The slabs can be defined from a heterogeneous pool of physical storage. The system also maintains multiple “volumes” above the region layer. Each volume includes one or more logical extents from one or more regions. Layouts of the extents within the regions are not visible to any of the volumes.

Abstract translation: 存储系统提供高度灵活的数据布局，可以针对各种不同的应用程序和用例进行定制。 系统根据服务水平目标（SLO）将性能与块共享动态平衡。 系统定义了几种类型的数据容器，包括“区域”，“逻辑盘区”和“板”。 每个区域包括一个或多个逻辑盘区。 分配到每个逻辑范围的至少一部分是分配给包含该范围的区域的一个或多个slab。 每个平板是来自一个或多个物理存储设备的一组存储块。 板可以从物理存储的异构池定义。 该系统还在区域层之上维护多个“体积”。 每个卷包括来自一个或多个区域的一个或多个逻辑盘区。 区域内的区域的布局对于任何卷都不可见。

公开(公告)号：US20120179891A1

公开(公告)日：2012-07-12

申请号：US13351017

申请日：2012-01-16

Applicant: John K. Edwards ,  Blake H. Lewis ,  Robert M. English ,  Eric Hamilton ,  Peter F. Corbett

Inventor： John K. Edwards ,  Blake H. Lewis ,  Robert M. English ,  Eric Hamilton ,  Peter F. Corbett

IPC: G06F12/10

CPC classification number: G06F3/0689 ,  G06F3/0619 ,  G06F3/0665 ,  G06F17/30233

Abstract: A file system layout apportions an underlying physical volume into one or more virtual volumes (vvols) of a storage system. The underlying physical volume is an aggregate comprising one or more groups of disks, such as RAID groups, of the storage system. The aggregate has its own physical volume block number (pvbn) space and maintains metadata, such as block allocation structures, within that pvbn space. Each vvol has its own virtual volume block number (vvbn) space and maintains metadata, such as block allocation structures, within that vvbn space. Notably, the block allocation structures of a vvol are sized to the vvol, and not to the underlying aggregate, to thereby allow operations that manage data served by the storage system (e.g., snapshot operations) to efficiently work over the vvols.

Abstract translation: 文件系统布局将底层物理卷分配到存储系统的一个或多个虚拟卷（vvols）中。 底层物理卷是包含存储系统的一组或多组磁盘（如RAID组）的聚合。 聚合具有自己的物理卷块数（pvbn）空间，并在该pvbn空间内维护诸如块分配结构之类的元数据。 每个vvol具有自己的虚拟卷块号（vvbn）空间，并在该vvbn空间内维护诸如块分配结构的元数据。 值得注意的是，vvol的块分配结构的大小适合于vvol，而不是基础聚合，从而允许管理由存储系统服务的数据（例如，快照操作）的操作有效地在vvols上工作。

公开(公告)号：US20110225364A1

公开(公告)日：2011-09-15

申请号：US13115541

申请日：2011-05-25

Applicant: John K. Edwards

Inventor： John K. Edwards

IPC: G06F12/02 ,  G06F12/16

CPC classification number: G06F17/30233 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30091 ,  Y10S707/99943 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: A plurality of storage devices is organized into a physical volume called an aggregate, and the aggregate is organized into a global storage space, and a data block is resident on one of the storage devices of the plurality of storage devices. A plurality of virtual volumes is organized within the aggregate and he data block is allocated to a virtual volume. A physical volume block number (pvbn) is selected for the data block from a pvbn space of the aggregate, and virtual volume block number (vvbn) for the data block is selected from a vvbn space of the selected vvol. Both the selected pvbn and the selected vvbn are inserted in a parent block as block pointers to point to the allocated data block on the storage device.

Abstract translation: 将多个存储设备组织成称为聚合的物理卷，并且聚合被组织成全局存储空间，并且数据块驻留在多个存储设备中的一个存储设备上。 在聚合内组织多个虚拟卷，并将数据块分配给虚拟卷。 从聚合的pvbn空间为数据块选择物理卷块号（pvbn），并且从所选vvol的vvbn空间中选择数据块的虚拟卷块号（vvbn）。 所选择的pvbn和所选的vvbn都作为块指针插入到父块中，以指向存储设备上分配的数据块。

公开(公告)号：US07930326B2

公开(公告)日：2011-04-19

申请号：US11866957

申请日：2007-10-03

Applicant: Douglas P. Doucette ,  Blake Lewis ,  John K. Edwards

Inventor： Douglas P. Doucette ,  Blake Lewis ,  John K. Edwards

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F3/0605 ,  G06F3/0608 ,  G06F3/0631 ,  G06F3/0643 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30067 ,  Y10S707/99943 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: A file system determines the relative vacancy of a collection of storage blocks, i.e., an “allocation area”. This is accomplished by recording an array of numbers, each of which describes the vacancy of a collection of storage blocks. The file system examines these numbers when attempting to record file blocks in relatively contiguous areas on a storage medium, such as a disk. When a request to write to disk occurs, the system determines the average vacancy of all of the allocation areas and queries the allocation areas for individual vacancy rates. The system preferably writes file blocks to the allocation areas that are above a threshold related to the average storage block vacancy of the file system.

Abstract translation: 文件系统确定存储块集合的相对空位，即“分配区域”。 这是通过记录一组数字来实现的，每个数组描述了一组存储块的空位。 当尝试在诸如磁盘的存储介质上的相对连续的区域中记录文件块时，文件系统检查这些数字。 当发出写入磁盘的请求时，系统确定所有分配区域的平均空缺，并查询各个空缺率的分配区域。 系统优选地将文件块写入高于与文件系统的平均存储块空缺相关的阈值的分配区域。

公开(公告)号：US07930275B2

公开(公告)日：2011-04-19

申请号：US11290217

申请日：2005-11-29

Applicant: Raymond C. Chen ,  Kayuri Patel ,  Andy C. Kahn ,  John K. Edwards

Inventor： Raymond C. Chen ,  Kayuri Patel ,  Andy C. Kahn ,  John K. Edwards

IPC: G06F17/30 ,  G06F12/00

CPC classification number: G06F17/30067

Abstract: The present invention relates to a system for restoring a file from a snapshot, where a version of the file exists in both an active file system and the snapshot. A twin inode is created in the active file system and comparisons are made between block pointers of the twin inode and the snapshot. If there is a match, the block pointer of the twin inode is moved to the active file system. If there is not a match, a determination is made whether the snapshot block pointer exists in the active file system. If the snapshot block pointer does not exist in the active file system, it is copied to the active file system. If it does exist, then the actual data block pointed to by the snapshot block pointer is copied to the active file system. In this way, a file may be restored without the need to always copy every individual data block or inode from the snapshot.

Abstract translation: 本发明涉及一种用于从快照恢复文件的系统，其中文件的版本存在于活动文件系统和快照中。 在活动文件系统中创建一个双引号，并且在双引号和快照的块指针之间进行比较。 如果有匹配，则双胞胎inode的块指针将被移动到活动文件系统。 如果不匹配，则确定快照块指针是否存在于活动文件系统中。 如果活动文件系统中不存在快照块指针，则将其复制到活动文件系统。 如果存在，则将快照块指针指向的实际数据块复制到活动文件系统。 以这种方式，可以恢复文件，而不需要总是从快照中复制每个单独的数据块或inode。

公开(公告)号：US07698306B2

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

申请号：US11796687

申请日：2007-04-27

Applicant: Steven S. Watanabe ,  John K. Edwards ,  Blake H. Lewis

Inventor： Steven S. Watanabe ,  John K. Edwards ,  Blake H. Lewis

IPC: G06F17/30

CPC classification number: G06F11/1471 ,  G06F11/1441

Abstract: A system and method for enabling parallel replay of a backup memory log of client transaction request entries to a network storage appliance file system is provided. The backup memory is typically implemented as a non-volatile random access memory (NVRAM). An initiator establishes a swarm of messages with a plurality of transaction blocks pointing to logged request entries and related states associated therewith. The states represent the various phases of file system recovery and disk storage including a retrieval of disk information (data and meta-data), typically in the form of a LOAD, and a subsequent modify phase. The swarm is transferred to the file system for parallel disk information-retrieval in an interleaved process. Any transactions that cannot be performed due to a required prerequisite action (e.g. a prior file-create) are returned to the initiator for reloading once the prerequisite action has occurred.

Abstract translation: 提供了一种用于使客户机事务请求条目的备份存储器日志平行重放到网络存储设备文件系统的系统和方法。 备用存储器通常被实现为非易失性随机存取存储器（NVRAM）。 发起者建立一组消息，其中多个事务块指向与其相关联的记录的请求条目和相关状态。 这些状态表示文件系统恢复和磁盘存储的各个阶段，包括通常以LOAD的形式和随后的修改阶段检索磁盘信息（数据和元数据）。 在交织过程中，群集被传送到文件系统以进行并行盘信息检索。 一旦出现先决条件操作，任何由于必需的先决条件操作（例如先前的文件创建）而无法执行的事务都将返回给启动器进行重新加载。

公开(公告)号：US07593975B2

公开(公告)日：2009-09-22

申请号：US11109886

申请日：2005-04-20

Applicant: John K. Edwards ,  Jeffrey Heller

Inventor： John K. Edwards ,  Jeffrey Heller

IPC: G06F12/00

CPC classification number: G06F3/0643 ,  G06F3/0613 ,  G06F3/067 ,  G06F17/30135 ,  Y10S707/99933 ,  Y10S707/99953 ,  Y10S707/99957

Abstract: A defragmentation technique determines the extent to which data blocks of a file are fragmented on disks of a computer and, in response, efficiently relocates those blocks if such relocation improves the on-disk layout of the file. Each indirect block of the file is examined and the current layout of the range of pointers referencing the data blocks is determined. In addition, the number of operations needed to retrieve those data blocks from disks is calculated. A potential new layout is then estimated based on an average fullness of the file system. If the potential new layout improves the fragmentation of the current layout, then the data blocks for that range are relocated, if there is sufficient free space on disk. Otherwise, the blocks are not relocated and the current on-disk layout of the file is maintained.

Abstract translation: 碎片整理技术确定文件的数据块在计算机的磁盘上碎片的程度，并且作为响应，如果这种重定位改进了文件的磁盘布局，则有效地重新定位那些块。 检查文件的每个间接块，并确定引用数据块的指针范围的当前布局。 此外，计算从磁盘检索这些数据块所需的操作次数。 然后根据文件系统的平均丰满度来估计潜在的新布局。 如果潜在的新布局改善了当前布局的分段，那么如果磁盘上有足够的可用空间，则该范围的数据块将被重新定位。 否则，块不会重新定位，并且文件的当前磁盘布局保持不变。

公开(公告)号：US07552146B1

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

申请号：US11117212

申请日：2005-04-28

Applicant: Andy C. Kahn ,  John K. Edwards ,  Nitin Muppalaneni

Inventor： Andy C. Kahn ,  John K. Edwards ,  Nitin Muppalaneni

IPC: G06F17/30

CPC classification number: G06F11/0727 ,  G06F11/0751 ,  G06F11/1076 ,  G06F2211/103 ,  G06F2211/104 ,  Y10S707/99953

Abstract: A system and method are provided to check consistency of an aggregate capable of supporting flexible volumes. The method includes identifying an inode having a flexible volume type present in the aggregate; determining whether the inode is identified in a metadata directory of the aggregate; and performing consistency check on the flexible volume associated with the inode.

Abstract translation: 提供了一种系统和方法来检查能够支持灵活卷的聚合体的一致性。 该方法包括识别存在于聚合体中的具有柔性体积类型的节点; 确定所述聚合体的元数据目录中是否识别所述inode; 并对与inode相关联的灵活卷执行一致性检查。

公开(公告)号：US20080155220A1

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

申请号：US12042131

申请日：2008-03-04

Applicant: John K. Edwards

Inventor： John K. Edwards

IPC: G06F12/06

CPC classification number: G06F17/30233 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30091 ,  Y10S707/99943 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: A write allocation technique extends a conventional write allocation procedure employed by a write anywhere file system of a storage system. A write allocator of the file system implements the extended write allocation technique in response to an event in the file system. The extended write allocation technique efficiently allocates blocks, and frees blocks, to and from a virtual volume (vvol) of an aggregate. The aggregate is a physical volume comprising one or more groups of disks, such as RAID groups, underlying one or more vvols of the storage system. The aggregate has its own physical volume block number (pvbn) space and maintains metadata, such as block allocation structures, within that pvbn space. Each vvol also has its own virtual volume block number (vvbn) space and maintains metadata, such as block allocation structures, within that vvbn space. The inventive technique extends input/output efficiencies of the conventional write allocation procedure to comport with an extended file system layout of the storage system.

Abstract translation: 写分配技术扩展了存储系统的写任意文件系统所采用的常规写分配过程。 文件系统的写分配器响应于文件系统中的事件实现扩展写分配技术。 扩展写分配技术有效地分配块，并将块从聚合体的虚拟卷（vvol）中分离出来。 聚合是包含一组或多组磁盘的物理卷，例如RAID组，存储系统的一个或多个vvol。 聚合具有自己的物理卷块数（pvbn）空间，并在该pvbn空间内维护诸如块分配结构的元数据。 每个vvol还具有自己的虚拟卷块号（vvbn）空间，并在该vvbn空间内维护诸如块分配结构的元数据。 本发明的技术扩展了常规写入分配过程的输入/输出效率，以与存储系统的扩展文件系统布局相匹配。

公开(公告)号：US07321962B1

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

申请号：US11703380

申请日：2007-02-07

Applicant: Robert L. Fair ,  Ashish Prakash ,  Eric Hamilton ,  John K. Edwards ,  Robert M. English

Inventor： Robert L. Fair ,  Ashish Prakash ,  Eric Hamilton ,  John K. Edwards ,  Robert M. English

IPC: G06F12/00

CPC classification number: G06F3/064 ,  G06F3/0619 ,  G06F3/0643 ,  G06F3/067

Abstract: A method for transferring data of a hybrid virtual volume of a computer data storage system from a source to a destination is disclosed. The method first translates intermingled virtual and physical volume block numbers of the hybrid virtual volume into a data stream having only virtual volume block numbers. The method then sends the data stream to a destination computer.

Abstract translation: 公开了将计算机数据存储系统的混合虚拟卷的数据从源传送到目的地的方法。 该方法首先将混合虚拟卷的混合虚拟和物理卷块编号转换成仅具有虚拟卷块号的数据流。 该方法然后将数据流发送到目标计算机。