公开(公告)号：US09477420B2

公开(公告)日：2016-10-25

申请号：US14286900

申请日：2014-05-23

Applicant: NetApp, Inc.

Inventor： Sandeep Yadav ,  Rickard E. Faith ,  Subramaniam V. Periyagaram ,  Blake H. Lewis ,  Ashish Prakash

IPC: G06F9/00 ,  G06F9/315 ,  G06F3/06 ,  G06F17/30

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30153 ,  G06F2211/1014 ,  G06F2212/401

Abstract: Partially overwriting a compression group without decompressing compressed data can consumption of resources for the decompression. A storage server partially overwrites the compression group when a file block identifier of a client's write request resolves to the compression group. The compression group remains compressed while the partial overwriting is performed.

Abstract translation: 部分覆盖压缩组而不解压压缩数据可以消耗资源进行解压缩。 当客户机的写入请求的文件块标识符解析为压缩组时，存储服务器部分地覆盖压缩组。 在执行部分重写时，压缩组保持压缩。

公开(公告)号：US20150370485A1

公开(公告)日：2015-12-24

申请号：US14838614

申请日：2015-08-28

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

IPC: G06F3/06 ,  G06F11/14

CPC classification number: G06F3/065 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1464 ,  G06F17/30575 ,  G06F2201/84 ,  G06F2212/262

Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer, a persistence layer and an administration layer that interact to create a copy of a parent volume associated with a storage container on the one or more storage devices. A copy create start message is received at the persistence layer from the administration layer. The persistence layer ensures that dirty data for the parent volume is incorporated into the copy of the parent volume. New data for the parent volume received at the persistence layer during creation of the copy of the parent volume is prevented from incorporation into the copy of the parent volume. A reply to the copy create start message is sent from the persistence layer to the administration layer to initiate the creation of the copy of the parent volume at the volume layer.

Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有卷层，持久层和管理层的存储输入/输出（I / O）堆栈，所述卷层，持久层和管理层进行交互以创建与 存储容器在一个或多个存储设备上。 在管理层的持久层收到复制创建开始消息。 持久层确保父卷的脏数据合并到父卷的副本中。 在创建父卷的副本期间，在持久层处收到的父卷的新数据将被阻止并入父卷的副本。 将复制创建开始消息的答复从持久层发送到管理层，以启动在卷层创建父卷的副本。

公开(公告)号：US20150134879A1

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

申请号：US14078146

申请日：2013-11-12

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

IPC: G06F3/06

CPC classification number: G06F3/065 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1464 ,  G06F17/30575 ,  G06F2201/84 ,  G06F2212/262

Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer that manages volume metadata. The volume metadata is organized as one or more dense tree metadata structures having a top level residing in memory and lower levels residing on the one or more storage devices. The dense tree metadata structures include a first dense tree metadata structure associated with a parent volume and a second dense tree metadata structure associated with a copy of the parent volume. The top level of the first dense tree metadata structure may be copied to the second dense tree metadata structure. The lower levels of the first dense tree metadata structure are initially shared with the second dense tree metadata structure. The shared lower levels may eventually be split as the parent volume diverges from the copy of the parent volume.

Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有管理卷元数据的卷层的存储输入/输出（I / O）堆栈。 卷元数据被组织为一个或多个密集树元数据结构，其具有驻留在存储器中的顶级和驻留在一个或多个存储设备上的较低级别。 密集树元数据结构包括与父卷相关联的第一密集树元数据结构和与父卷的副本相关联的第二密集树元数据结构。 第一密集树元数据结构的顶层可以被复制到第二密集树元数据结构。 第一密集树元数据结构的较低级别最初与第二密集树元数据结构共享。 共享的较低级别最终可能会因父体卷从父卷的副本分歧而被拆分。

公开(公告)号：US20150134616A1

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

申请号：US14162106

申请日：2014-01-23

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

IPC: G06F17/30

CPC classification number: G06F3/065 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1464 ,  G06F17/30575 ,  G06F2201/84 ,  G06F2212/262

Abstract: In one embodiment, snapshots and/or clones of storage objects are created and managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. Illustratively, the snapshots and clones may be represented as independent volumes, and embodied as respective read-only copies (snapshots) and read-write copies (clones) of a parent volume. Volume metadata is illustratively organized as one or more multi-level dense tree metadata structures, wherein each level of the dense tree metadata structure (dense tree) includes volume metadata entries for storing the metadata. Each snapshot/clone may be derived from a dense tree of the parent volume (parent dense tree). Portions of the parent dense tree may be shared with the snapshot/clone.

Abstract translation: 在一个实施例中，由集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层创建和管理存储对象的快照和/或克隆。 说明性地，快照和克隆可以表示为独立卷，并且被体现为父卷的相应的只读副本（快照）和读写副本（克隆）。 卷元数据被示例性地组织为一个或多个多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储元数据的卷元数据条目。 每个快照/克隆可以从父卷（父密集树）的密集树导出。 父密度树的部分可能与快照/克隆共享。

公开(公告)号：US08892818B1

公开(公告)日：2014-11-18

申请号：US14162228

申请日：2014-01-23

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

IPC: G06F12/00 ,  G06F17/30

CPC classification number: G06F17/30327 ,  G06F3/0611 ,  G06F3/0619 ,  G06F3/0638 ,  G06F3/0641 ,  G06F3/0655 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30 ,  G06F17/30292

Abstract: The embodiments described herein are directed to an organization of metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The metadata managed by the volume layer, i.e., the volume metadata, is illustratively embodied as mappings from addresses, i.e., logical block addresses (LBAs), of a logical unit (LUN) accessible by a host to durable extent keys maintained by an extent store layer of the storage I/O stack. In an embodiment, the volume layer organizes the volume metadata as a mapping data structure, i.e., a dense tree metadata structure, which represents successive points in time to enable efficient access to the metadata.

Abstract translation: 这里描述的实施例涉及由在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的元数据的组织。 由卷层管理的元数据（即卷元数据）被示意性地体现为从主机可访问的逻辑单元（LUN）的地址（即，逻辑块地址（LBA））到可由扩展区维护的持久范围密钥的映射 存储I / O堆栈的存储层。 在一个实施例中，卷层将卷元数据组织为映射数据结构，即密集树元数据结构，其表示连续的时间点以实现对元数据的有效访问。

公开(公告)号：US10042853B2

公开(公告)日：2018-08-07

申请号：US15239125

申请日：2016-08-17

Applicant: NetApp, Inc.

Inventor： Rajesh Sundaram ,  Stephen Daniel ,  Jeffrey S. Kimmel ,  Blake H. Lewis

IPC: G06F12/00 ,  G06F17/30 ,  G06F3/06 ,  G06F12/02

Abstract: A flash-optimized, log-structured layer of a file system of a storage input/output (I/O) stack executes on one or more nodes of a cluster. The log-structured layer of the file system provides sequential storage of data and metadata (i.e., a log-structured layout) on solid state drives (SSDs) of storage arrays in the cluster to reduce write amplification, while leveraging variable compression and variable length data features of the storage I/O stack. The data may be organized as an arbitrary number of variable-length extents of one or more host-visible logical units (LUNs) served by the nodes. The metadata may include mappings from host-visible logical block address ranges (i.e., offset ranges) of a LUN to extent keys, as well as mappings of the extent keys to SSD storage locations of the extents. The storage location of an extent on SSD is effectively “virtualized” by its mapped extent key (i.e., extent store layer mappings) such that relocation of the extent on SSD does require update to volume layer metadata (i.e., the extent key sufficiently identifies the extent).

公开(公告)号：US20180095685A1

公开(公告)日：2018-04-05

申请号：US15820004

申请日：2017-11-21

Applicant: NetApp, Inc.

Inventor： Janice D'Sa ,  Ling Zheng ,  Blake H. Lewis

IPC: G06F3/06 ,  H04L29/08

CPC classification number: G06F3/0619 ,  G06F3/0607 ,  G06F3/0626 ,  G06F3/0644 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  H04L67/1097

Abstract: A N-way merge technique efficiently updates metadata in accordance with a N-way merge operation managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The metadata is embodied as mappings from logical block addresses (LBAs) of a logical unit (LUN) accessible by a host to durable extent keys, and is organized as a multi-level dense tree. The mappings are organized such that a higher level of the dense tree contains more recent mappings than a next lower level, i.e., the level immediately below. The N-way merge operation is an efficient (i.e., optimized) way of updating the volume metadata mappings of the dense tree by merging the mapping content of all three levels in a single iteration, as opposed to merging the content of the first level with the content of the second level in a first iteration of a two-way merge operation and then merging the results of the first iteration with the content of the third level in a second iteration of the operation.

公开(公告)号：US20160357776A1

公开(公告)日：2016-12-08

申请号：US15239125

申请日：2016-08-17

Applicant: NetApp, Inc.

Inventor： Rajesh Sundaram ,  Stephen Daniel ,  Jeffrey S. Kimmel ,  Blake H. Lewis

IPC: G06F17/30 ,  G06F3/06 ,  G06F12/02

CPC classification number: G06F17/30138 ,  G06F3/0604 ,  G06F3/0608 ,  G06F3/0616 ,  G06F3/064 ,  G06F3/0643 ,  G06F3/0644 ,  G06F3/0647 ,  G06F3/0659 ,  G06F3/0679 ,  G06F3/0685 ,  G06F3/0688 ,  G06F12/0246 ,  G06F17/30185 ,  G06F17/30218 ,  G06F2003/0697 ,  G06F2212/2022 ,  G06F2212/7208

Abstract: A flash-optimized, log-structured layer of a file system of a storage input/output (I/O) stack executes on one or more nodes of a cluster. The log-structured layer of the file system provides sequential storage of data and metadata (i.e., a log-structured layout) on solid state drives (SSDs) of storage arrays in the cluster to reduce write amplification, while leveraging variable compression and variable length data features of the storage I/O stack. The data may be organized as an arbitrary number of variable-length extents of one or more host-visible logical units (LUNs) served by the nodes. The metadata may include mappings from host-visible logical block address ranges (i.e., offset ranges) of a LUN to extent keys, as well as mappings of the extent keys to SSD storage locations of the extents. The storage location of an extent on SSD is effectively “virtualized” by its mapped extent key (i.e., extent store layer mappings) such that relocation of the extent on SSD does require update to volume layer metadata (i.e., the extent key sufficiently identifies the extent).

Abstract translation: 存储输入/输出（I / O）堆栈的文件系统的闪存优化的日志结构化层在集群的一个或多个节点上执行。 文件系统的日志结构化层在集群中的存储阵列的固态驱动器（SSD）上提供数据和元数据（即，日志结构化布局）的顺序存储，以减少写入放大，同时利用可变压缩和可变长度 存储I / O堆栈的数据特征。 数据可以被组织为由节点服务的一个或多个主机可见逻辑单元（LUN）的可变长度范围的任意数量。 元数据可以包括从LUN到扩展密钥的主机可见逻辑块地址范围（即，偏移范围）的映射，以及扩展密钥到扩展区的SSD存储位置的映射。 SSD上的盘区的存储位置被其映射的盘区密钥（即，盘区存储层映射）有效地“虚拟化”，使得SSD上盘区的重新定位需要更新到卷层元数据（即，扩展密钥足够地识别 程度）。

公开(公告)号：US09471248B2

公开(公告)日：2016-10-18

申请号：US14838614

申请日：2015-08-28

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis ,  Kayuri H. Patel

IPC: G06F3/06 ,  G06F17/30 ,  G06F11/14

CPC classification number: G06F3/065 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/1464 ,  G06F17/30575 ,  G06F2201/84 ,  G06F2212/262

Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer, a persistence layer and an administration layer that interact to create a copy of a parent volume associated with a storage container on the one or more storage devices. A copy create start message is received at the persistence layer from the administration layer. The persistence layer ensures that dirty data for the parent volume is incorporated into the copy of the parent volume. New data for the parent volume received at the persistence layer during creation of the copy of the parent volume is prevented from incorporation into the copy of the parent volume. A reply to the copy create start message is sent from the persistence layer to the administration layer to initiate the creation of the copy of the parent volume at the volume layer.

Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有卷层，持久层和管理层的存储输入/输出（I / O）堆栈，所述卷层，持久层和管理层进行交互以创建与 存储容器在一个或多个存储设备上。 在管理层的持久层收到复制创建开始消息。 持久层确保父卷的脏数据合并到父卷的副本中。 在创建父卷的副本期间，在持久层处收到的父卷的新数据将被阻止并入父卷的副本。 将复制创建开始消息的答复从持久层发送到管理层，以启动在卷层创建父卷的副本。

公开(公告)号：US20160048333A1

公开(公告)日：2016-02-18

申请号：US14927607

申请日：2015-10-30

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis

IPC: G06F3/06

CPC classification number: G06F3/061 ,  G06F3/0604 ,  G06F3/0644 ,  G06F3/0646 ,  G06F3/0685 ,  G06F3/0688 ,  G06F17/30327

Abstract: The embodiments described herein are directed to efficient merging of metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The metadata managed by the volume layer, i.e., the volume metadata, is illustratively organized as a multi-level dense tree metadata structure, wherein each level of the dense tree metadata structure (dense tree) includes volume metadata entries for storing the volume metadata. The volume metadata entries of an upper level of the dense tree metadata structure are merged with the volume metadata entries of a next lower level of the dense tree metadata structure when the upper level is full. The volume metadata entries of the merged levels are organized as metadata pages and stored as one or more files on the SSDs.

Abstract translation: 这里描述的实施例涉及由在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层管理的元数据的有效合并。 由卷层管理的元数据，即卷元数据被说明性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 密集树元数据结构的较高级别的卷元数据条目与较高级别已满的密集树元数据结构的下一级较低级别的卷元数据条目合并。 合并级别的卷元数据条目被组织为元数据页面，并作为一个或多个文件存储在SSD上。