公开(公告)号：US20160070644A1

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

申请号：US14482957

申请日：2014-09-10

Applicant: NetApp, Inc.

Inventor： Janice D'Sa ,  Anshul Pundir ,  Srinath Krishnamachari ,  Ling Zheng ,  Jeffrey S. Kimmel

IPC: G06F12/02 ,  G06F3/06

CPC classification number: G06F3/0688 ,  G06F3/0611 ,  G06F3/0644

Abstract: An offset range striping technique increases concurrency of operation execution directed to metadata managed by a volume layer of a storage input/output (I/O) stack, while reducing contention among resources of one or more nodes of a cluster. A logical unit (LUN) may be apportioned into multiple volumes, each of which may be partitioned into multiple regions, wherein each region is represented by a dense tree. The technique increases concurrency of operation execution (e.g., modifications to the metadata at the offset ranges), while reducing contention among the resources (e.g., CPUs and NVLogs) by distributing the offset range operations among the regions and mapping the regions to services and NVLogs. Such increased concurrency and reduction of contention may be achieved by implementation of the technique to (i) apportion each region into disjoint chunks (i.e., stripes) of contiguous offset ranges; (ii) organize a plurality of regions into one or more zones and populate a first zone before allocating a second zone; and (iii) stagger the mapping of services to starting regions of the volumes.

Abstract translation: 偏移范围条带化技术增加了针对由存储输入/输出（I / O）堆栈的卷层管理的元数据的操作执行的并发性，同时减少了集群的一个或多个节点的资源之间的争用。 逻辑单元（LUN）可以被分配成多个卷，每个卷可被划分成多个区域，其中每个区域由密集的树表示。 该技术增加了操作执行的并发性（例如，在偏移范围内对元数据的修改），同时通过在区域之间分配偏移范围操作来减少资源（例如，CPU和NVLogs）之间的争用，并将该区域映射到服务和NVLogs 。 这种增加的并发性和降低竞争力可以通过实现该技术来实现，以（i）将每个区域分配成相邻偏移范围的不相交的块（即条带）; （ii）在分配第二区域之前将多个区域组织成一个或多个区域并填充第一区域; 和（iii）将服务的映射错开到卷的起始区域。

公开(公告)号：US20160070618A1

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

申请号：US14482618

申请日：2014-09-10

Applicant: NetApp, Inc.

Inventor： Anshul Pundir ,  Janice D'Sa ,  Srinath Krishnamachari ,  Ling Zheng

IPC: G06F11/10 ,  G06F11/14 ,  G06F11/20

CPC classification number: G06F11/1438 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/067 ,  G06F3/0679 ,  G06F7/32 ,  G06F11/1088 ,  G06F11/1451 ,  G06F11/1471 ,  G06F11/2069 ,  G06F17/30327 ,  G06F2201/80 ,  G06F2201/805 ,  G06F2201/82 ,  G06F2201/84 ,  G06F2211/104

Abstract: Embodiments herein are directed to efficient crash recovery of persistent metadata managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. Volume metadata managed by the volume layer is organized as a multi-level dense tree, wherein each level of the dense tree includes volume metadata entries for storing the volume metadata. When a level of the dense tree is full, the volume metadata entries of the level are merged with the next lower level of the dense tree. During a merge operation, two sets of generation IDs may be used in accordance with a double buffer arrangement: a first generation ID for the append buffer that is full (i.e., a merge staging buffer) and a second, incremented generation ID for the append buffer that accepts new volume metadata entries. Upon completion of the merge operation, the lower level (e.g., level 1) to which the merge is directed is assigned the generation ID of the merge staging buffer.

Abstract translation: 这里的实施例涉及由在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的持久元数据的有效崩溃恢复。 由卷层管理的卷元数据组织为多级密集树，其中密集树的每个级别包括用于存储卷元数据的卷元数据条目。 当密集树的级别已满时，级别的卷元数据条目将与密集树的下一个较低级别合并。 在合并操作期间，可以根据双缓冲器布置来使用两组生成ID：用于追加缓冲器的第一代ID（即，合并暂存缓冲器）和用于附加的第二增量生成ID 接受新的卷元数据条目的缓冲区。 在合并操作完成后，向合并处理缓冲器的生成ID分配合并所指示的较低级别（例如，级别1）。

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

公开(公告)号：US09152684B2

公开(公告)日：2015-10-06

申请号：US14078146

申请日：2013-11-12

Applicant: NetApp, Inc.

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

IPC: G06F3/06 ,  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, 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）堆栈。 卷元数据被组织为一个或多个密集树元数据结构，其具有驻留在一个或多个存储设备上的存储器中的最高级别和较低级别。 密集树元数据结构包括与父卷相关联的第一密集树元数据结构和与父卷的副本相关联的第二密集树元数据结构。 第一密集树元数据结构的顶层可以被复制到第二密集树元数据结构。 第一密集树元数据结构的较低级别最初与第二密集树元数据结构共享。 共享的较低级别最终可能会因父体卷从父卷的副本分歧而被拆分。

公开(公告)号：US09037544B1

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

申请号：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）栈的卷层创建和管理存储对象的快照和/或克隆。 说明性地，快照和克隆可以表示为独立卷，并且被体现为父卷的相应的只读副本（快照）和读写副本（克隆）。 卷元数据被示例性地组织为一个或多个多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储元数据的卷元数据条目。 每个快照/克隆可以从父卷（父密集树）的密集树导出。 父密度树的部分可能与快照/克隆共享。

公开(公告)号：US08996797B1

公开(公告)日：2015-03-31

申请号：US14161097

申请日：2014-01-22

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis

IPC: G06F12/02 ,  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 logging and checkpointing 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. Each volume metadata entry may be a descriptor that embodies one of a plurality of types, including a data entry and an index entry, and a hole (i.e., absence of data) entry.

Abstract translation: 这里描述的实施例涉及由在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的元数据的有效记录和检查点。 由卷层管理的元数据，即卷元数据被说明性地组织为多级密集树元数据结构，其中密集树元数据结构（密集树）的每个级别包括用于存储卷元数据的卷元数据条目。 每个卷元数据条目可以是体现多个类型中的一个类型的描述符，包括数据条目和索引条目，以及空格（即，不存在数据）条目。

公开(公告)号：US20150081966A1

公开(公告)日：2015-03-19

申请号：US14027994

申请日：2013-09-16

Applicant: NetApp, Inc.

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

IPC: G06F3/06

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: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer. The volume layer manages volume metadata embodied as mappings from offsets of a logical unit (LUN) to extent keys associated with storage locations for extents on the one or more storage devices. Volume metadata is maintained as a dense tree metadata structure representing successive points in time. The dense tree metadata structure has multiple levels, wherein a top level of the dense tree metadata structure represents newer volume metadata changes and descending levels of the dense tree metadata structure represent older volume metadata changes. The node accesses a latest version of changes to the volume metadata by searching from the top level to the descending levels in the dense tree metadata structure.

Abstract translation: 在一个实施例中，耦合到一个或多个存储设备的节点执行具有体积层的存储输入/输出（I / O）堆栈。 卷层管理体现为从逻辑单元（LUN）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。

公开(公告)号：US20250004986A1

公开(公告)日：2025-01-02

申请号：US18432243

申请日：2024-02-05

Applicant: NetApp, Inc.

Inventor： Kiyoshi Komatsu ,  Ardalan Kangarlou ,  Richard Swift ,  Rajesh Rajaraman ,  Ling Zheng

IPC: G06F16/11 ,  G06F11/14 ,  G06F12/02 ,  G06F16/16 ,  G06F16/182

Abstract: Systems, methods, and machine-readable media for creating, deleting, and restoring volume snapshots in a remote data store are disclosed. A storage volume and a storage operating system are implemented in a software container. Through a user interface, a user may create a snapshot of the volume to a cloud storage. A user may also delete individual snapshots from the cloud storage. Further, deletion of a most recent snapshot may occur by awaiting deletion (though marking as deleted to the user) until a next snapshot is received. Snapshots in the cloud storage are manipulatable even after destruction of the source volume (by destruction of the container, for example). A controller outside the container is used by implementing the same API as the controller in the container had. Full restores of snapshots in the cloud are also possible even when the original container and volume have been destroyed.

公开(公告)号：US20240378121A1

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

申请号：US18779567

申请日：2024-07-22

Applicant: NetApp, Inc.

Inventor： Jose Mathew ,  Ling Zheng

IPC: G06F11/14 ,  G06F3/06 ,  G06F9/455

Abstract: Techniques are provided for orchestrating operations between a storage environment and a computing environment hosting virtual machines. A virtual machine proxy, associated with a computing environment hosting a virtual machine, is accessed by an orchestrator to identify the virtual machine and properties of the virtual machine. A storage proxy, associated with a storage environment comprising a volume within which snapshots of the virtual machine are to be stored, is accessed by the orchestrator to initialize a backup procedure. The orchestrator utilizes the virtual machine proxy to create a snapshot of the virtual machine. The orchestrator utilizes the storage proxy to back up the snapshot to the volume using the backup procedure.

公开(公告)号：US20240273186A1

公开(公告)日：2024-08-15

申请号：US18168741

申请日：2023-02-14

Applicant: NetApp, Inc.

Inventor： Tijin George ,  Vijay Srinath ,  Ling Zheng

IPC: G06F21/55 ,  G06F16/11 ,  G06F16/178 ,  G06F21/62

CPC classification number: G06F21/552 ,  G06F16/125 ,  G06F16/128 ,  G06F16/178 ,  G06F21/6218 ,  G06F2221/034

Abstract: Systems and methods for creation and retention of immutable snapshots to facilitate ransomware protection are provided. According to one embodiment, multiple use cases for retention of snapshots are supported, including (i) maintaining a locked snapshot on a source volume of a first storage system on which it was originally created for at least an associated immutable retention time; (ii) replicating the locked snapshot to a destination volume of a second storage system and also maintaining the replica of the locked snapshot on the destination volume for at least the associated immutable retention time; and (iii) maintaining an unlocked snapshot on the source volume, replicating the unlocked snapshot to the destination volume, locking the replicated snapshot on the destination volume when it has an associated non-zero immutable retention time, and thereafter maintaining the replica on the destination volume in accordance with the immutable retention time.