公开(公告)号：US09952767B2

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

申请号：US15142767

申请日：2016-04-29

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Ning Zhao ,  Radek Aster ,  Jeffrey S. Kimmel

IPC: G06F3/06

CPC classification number: G06F3/0604 ,  G06F3/0617 ,  G06F3/065 ,  G06F3/0656 ,  G06F3/067 ,  G06F11/20

Abstract: A consistency group is used as a basic unit of data management of storage containers served by a storage input/output (I/O) stack executing on one or more nodes of a cluster. The storage container may be a LUN embodied as parent volume (active volume), a snapshot (represented as an independent volume embodied as read-only copy of the active volume), and a clone (represented as another independent volume embodied as a read-write copy (clone) of the active volume). A consistency group (CG) is a set (i.e., collection) of objects, e.g., LUNs or other CGs (nested CG), which may be managed and operated upon collectively by an administrative command via a Storage Area Network administration layer (SAL) of the storage I/O stack. The SAL may interact with one or more layers of the storage I/O stack to (i) create a clone of a set of object members of the CG; (ii) create one or more snapshots of the set of object members of the CG; (iii) restore the set of object members of the CG from a group of CG snapshots; (iv) replicate the set of object members of the CG as a single entity; and (v) delete a CG and a nested CG according to specific semantics.

公开(公告)号：US09928249B2

公开(公告)日：2018-03-27

申请号：US15410789

申请日：2017-01-20

Applicant: NetApp, Inc.

Inventor： Blake Lewis ,  Ling Zheng ,  Craig Johnston ,  Vinod Daga

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

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0659 ,  G06F3/067

Abstract: A system can maintain multiple queues for deduplication requests of different priorities. The system can also designate priority of storage units. The scheduling priority of a deduplication request is based on the priority of the storage unit indicated in the deduplication request and a trigger for the deduplication request.

公开(公告)号：US20170318089A1

公开(公告)日：2017-11-02

申请号：US15142126

申请日：2016-04-29

Applicant: NetApp Inc.

Inventor： Atul Ramesh Pandit ,  Vijay M. Deshmukh ,  Michael Lee Federwisch ,  Ling Zheng ,  Kiyoshi James Komatsu ,  Rachita Kothiyal

IPC: H04L29/08 ,  G06F11/20

CPC classification number: G06F11/2069 ,  G06F11/2071 ,  G06F11/2092 ,  G06F2201/805 ,  H04L67/1095 ,  H04L67/1097

Abstract: One or more techniques and/or computing devices are provided for cross-platform replication. For example, a replication relationship may be established between a first storage endpoint and a second storage endpoint, where at least one of the storage endpoints, such as the first storage endpoint, lacks or has incompatible functionality to perform and manage replication because the storage endpoints have different storage platforms that store data differently, use different control operations and interfaces, etc. Accordingly, replication destination workflow, replication source workflow, and/or a proxy representing the first storage endpoint may be implemented at the second storage endpoint comprising the replication functionality. In this way, replication, such as snapshot replication, may be implemented between the storage endpoints by the second storage endpoint using the replication destination workflow, the replication source workflow, and/or the proxy that either locally executes tasks or routes tasks to the first storage endpoint such as for data access.

公开(公告)号：US20170315878A1

公开(公告)日：2017-11-02

申请号：US15143370

申请日：2016-04-29

Applicant: NetApp, Inc.

Inventor： Prahlad Purohit ,  Ling Zheng ,  Christopher Joseph Corsi

IPC: G06F11/14 ,  G06F17/30

CPC classification number: G06F11/1458 ,  G06F3/061 ,  G06F3/065 ,  G06F3/067 ,  G06F16/24573 ,  G06F16/27 ,  G06F2201/84

Abstract: A technique efficiently manages a snapshot and/or clone by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of the cluster. According to the technique, an ownership attribute is included in metadata entries of a dense tree data structure for extents that eliminates otherwise needed reference count operations for the snapshots and reduces reference count operations for the clones. Illustratively, a copy of a parent dense tree level created by a copy-on-write (COW) operation is referred to as a “derived level”, whereas the existing level of the parent dense tree is referred to as a “source level”. The source level may be persistently linked to the derived level by keeping “level identifying key information” in a respective dense tree source level header. Moreover, two different types of dense tree derivations are defined: a derive relationship and a reverse-derive relationship.

公开(公告)号：US20170308305A1

公开(公告)日：2017-10-26

申请号：US15137542

申请日：2016-04-25

Applicant: NetApp, Inc.

Inventor： Atul Goel ,  Ling Zheng ,  Prahlad Purohit

IPC: G06F3/06

CPC classification number: G06F3/0608 ,  G06F3/0641 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/067

Abstract: A technique efficiently determines accurate storage space savings reported to a host coupled to a reference-counted storage system that employs de-duplication and compression, wherein the storage space savings relate to snapshots and/or clones supported by the storage system. The snapshot/clone may be represented as an independent volume, and embodied as a respective read-only copy (snapshot) or read-write copy (clone) of a parent volume. Metadata is illustratively organized as one or more multi-level dense trees, wherein each level of each dense tree includes volume metadata entries for storing the metadata. The metadata is illustratively embodied as mappings from LBAs of a LUN to extent keys. Space adjustment counters, such as clone space adjustment (CSA) and diverged space adjustment (DSA) counters, may be employed when determining the storage space savings. The CSA counter is equal to the sum of mapped storage space across all levels of a dense tree. The DSA counter for the clone and for the snapshot equals the total mapped storage space in the level. The storage space savings may be determined by computing a value equal to the addition of the CSA counter to the total amount of data and metadata written to the LUN minus the DSA counters and, thereafter, dividing the value by the total amount of de-duplicated and compressed data for the LUN that is physically stored.

公开(公告)号：US09740566B2

公开(公告)日：2017-08-22

申请号：US14869340

申请日：2015-09-29

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Long Yang ,  Kayuri H. Patel ,  Suhas Prakash ,  Jeffrey S. Kimmel ,  Anshul Pundir ,  Arun Rokade

IPC: G06F12/10 ,  G06F11/14 ,  G06F3/06

CPC classification number: G06F11/1446 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0683 ,  G06F2201/84

Abstract: A technique efficiently creates a snapshot for a logical unit (LUN) served by a storage input/output (I/O) stack executing on a node of a cluster that organizes data as extents referenced by keys. In addition, the technique efficiently creates one or more snapshots for a group of LUNs organized as a consistency group (CG) and served by storage I/O stacks executing on a plurality of nodes of the cluster. To that end, the technique involves a plurality of indivisible operations (i.e., transactions) of a snapshot creation workflow administered by a Storage Area Network (SAN) administration layer (SAL) of the storage I/O stack in response to a snapshot create request issued by a host. The SAL administers the snapshot creation workflow by initiating a set of transactions that includes, inter alia, (i) installation of barriers for LUNs (volumes) across all nodes in the cluster that participate in snapshot creation, (ii) creation of point-in-time (PIT) markers to record those I/O requests that are included in the snapshot, and (iii) updating of records (entries) in snapshot and volume tables of a cluster database (CDB).

公开(公告)号：US20170212919A1

公开(公告)日：2017-07-27

申请号：US15005593

申请日：2016-01-25

Applicant: NetApp, Inc.

Inventor： Anthony J. Li ,  Srinath Krishnamachari ,  Ling Zheng

IPC: G06F17/30 ,  G06F13/40 ,  G06F13/16

CPC classification number: G06F16/2246 ,  G06F13/1668 ,  G06F13/4068 ,  G06F16/2379

Abstract: A bottom-up technique repairs a data structure, e.g., a multi-level dense tree, used to organize volume metadata as metadata entries managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The bottom-up repair technique implements a progressive repair algorithm that initially involves traversing each level of the dense tree to determine consistency of metadata entries by ensuring that the entries, e.g., (i) monotonically increase, (ii) do not overlap and (iii), if appropriate, reference (point to) existing entries of a lower level. The technique detects and corrects inconsistencies by, e.g., deleting out-of-order and overlapping entries, and adjusting the range of an index entry to reference the corresponding lower level entry. The technique then examines whether metadata entries at a lower level of the tree are referenced (pointed to) by corresponding index entries in an upper (parent) level. If there is no index entry at the upper level pointing to a lower level entry (i.e., a gap in offset range), the upper level is fixed (repaired) by employing a gap analysis procedure.

公开(公告)号：US20170192710A1

公开(公告)日：2017-07-06

申请号：US14988435

申请日：2016-01-05

Applicant: NetApp, Inc.

Inventor： Anshul Pundir ,  Ling Zheng ,  David Brittain Bolen

IPC: G06F3/06

CPC classification number: G06F3/0644 ,  G06F3/0608 ,  G06F3/067

Abstract: A technique enables recovery of storage space trapped in an extent store due to overlapping write requests associated with metadata managed by a volume layer of a storage input/output stack executing on one or more nodes of a cluster. The metadata is organized as a multi-level dense tree metadata structure, wherein each level of the dense tree includes volume metadata entries for storing the metadata. When a level of the dense tree is full, the volume metadata entries of the level are merged with a next lower level of the dense tree in accordance with a dense tree merge operation. The technique may be invoked during the merge operation to process the volume metadata entries associated with the overlapping write requests at each level of the dense tree involved in the merge operation. Processing of the overlapping write requests during the merge operation may manifest as partial overwrites of one or more existing extents which, in turn, may result in logical storage space being trapped in the extent store. The technique may perform read-modify-write (RMW) operations on the partially overwritten extents to recapture that trapped space. The storage space trapped by the partially overwritten extents may be recovered by reading and re-writing one or more valid portions of each extent with storage space lockup through the use of “out-of-band”, i.e., independent of the merge, processing of the RMW operations.

公开(公告)号：US09563654B2

公开(公告)日：2017-02-07

申请号：US14978290

申请日：2015-12-22

Applicant: NetApp, Inc.

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

IPC: G06F3/06 ,  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堆栈的存储层。 在一个实施例中，卷层将卷元数据组织为映射数据结构，即密集树元数据结构，其表示连续的时间点以实现对元数据的有效访问。

公开(公告)号：US20170031769A1

公开(公告)日：2017-02-02

申请号：US14869340

申请日：2015-09-29

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Long Yang ,  Kayuri H. Patel ,  Suhas Prakash ,  Jeffrey S. Kimmel ,  Anshul Pundir ,  Arun Rokade

IPC: G06F11/14 ,  G06F3/06

CPC classification number: G06F11/1446 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0683 ,  G06F2201/84

Abstract: A technique efficiently creates a snapshot for a logical unit (LUN) served by a storage input/output (I/O) stack executing on a node of a cluster that organizes data as extents referenced by keys. In addition, the technique efficiently creates one or more snapshots for a group of LUNs organized as a consistency group (CG) and served by storage I/O stacks executing on a plurality of nodes of the cluster. To that end, the technique involves a plurality of indivisible operations (i.e., transactions) of a snapshot creation workflow administered by a Storage Area Network (SAN) administration layer (SAL) of the storage I/O stack in response to a snapshot create request issued by a host. The SAL administers the snapshot creation workflow by initiating a set of transactions that includes, inter alia, (i) installation of barriers for LUNs (volumes) across all nodes in the cluster that participate in snapshot creation, (ii) creation of point-in-time (PIT) markers to record those I/O requests that are included in the snapshot, and (iii) updating of records (entries) in snapshot and volume tables of a cluster database (CDB).

Abstract translation: 一种技术可以有效地创建一个逻辑单元（LUN）的快照，该逻辑单元（LUN）由集群的节点上执行的存储输入/输出（I / O）堆栈提供服务，该集群将数据组织为密钥引用的扩展区。 此外，该技术有效地为被组织为一致性组（CG）并由在集群的多个节点上执行的存储I / O堆栈服务的一组LUN有效地创建一个或多个快照。 为此，该技术涉及响应于快照创建请求，由存储I / O堆栈的存储区域网络（SAN）管理层（SAL）管理的快照创建工作流的多个不可分割的操作（即事务） 由主机发出。 SAL通过启动一组事务来管理快照创建工作流，其中包括（i）在参与快照创建的集群中的所有节点上安装LUN（卷）的障碍，（ii）创建点对点 -time（PIT）标记来记录快照中包含的那些I / O请求，以及（iii）更新群集数据库（CDB）的快照和卷表中的记录（条目）。