公开(公告)号：US20190294586A1

公开(公告)日：2019-09-26

申请号：US16435829

申请日：2019-06-10

Applicant: NetApp Inc.

Inventor： Ajay Pratap Singh Kushwah ,  Ling Zheng ,  Sharad Jain

IPC: G06F16/11 ,  G06F16/13 ,  G06F11/14 ,  G06F12/121 ,  H04L29/08

Abstract: With a forever incremental snapshot configuration and a typical caching policy (e.g., least recently used), a storage appliance may evict stable data blocks of an older snapshot, perhaps unchanged data blocks of the snapshot baseline. If stable data blocks have been evicted, restore of a recent snapshot will suffer the time penalty of downloading the stable blocks for restoring the recent snapshot. Creating synthetic baseline snapshots and refreshing eviction data of stable data blocks can avoid eviction of stable data blocks and reduce the risk of violating a recovery time objective.

公开(公告)号：US20190129621A1

公开(公告)日：2019-05-02

申请号：US15796467

申请日：2017-10-27

Applicant: NetApp, Inc.

Inventor： Ajay Pratap Singh Kushwah ,  Ling Zheng ,  Sharad Jain

IPC: G06F3/06 ,  G06F11/14

Abstract: Intelligent snapshot tiering facilitates efficient management of snapshots and efficient restore of snapshots. For intelligent snapshot tiering, a storage appliance can limit cross-tier migration to invalidated data blocks of a snapshot instead of an entire snapshot. Based on a policy, a storage appliance can identify a snapshot to be migrated to another storage tier and then determine which data blocks are invalidated by an immediately succeeding snapshot. This would limit network bandwidth consumption to the invalidated data blocks and maintain the valid data blocks at the faster access storage tier since the more recent snapshots are more likely to be restored.

公开(公告)号：US09990260B2

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

申请号：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: G06F11/00 ,  G06F11/20 ,  H04L29/08

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.

公开(公告)号：US20170315728A1

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

申请号：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.

公开(公告)号：US20170212891A1

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

申请号：US15005884

申请日：2016-01-25

Applicant: NetApp, Inc.

Inventor： Anshul Pundir ,  Ling Zheng ,  Michael L. Federwisch

IPC: G06F17/30 ,  G06F9/50

CPC classification number: G06F9/50 ,  G06F3/06 ,  G06F3/0659 ,  G06F3/067

Abstract: A technique schedules processing of metadata managed by a volume layer of a storage input/output (I/O) stack executing on a node of cluster in a manner that reduces bursty activity associated with metadata processing and maintains smooth, i.e., bounded, processing latency on the node. Operations on the metadata managed by the volume layer manifest as modifications to metadata entries of data structures, i.e., dense trees, at offset ranges of the regions. The operations are dense tree merge operations that are processed by threads of execution, i.e., a uni-processor services, on one or more central processing units of the node. The scheduling technique distributes the bursty activity of the dense tree merge operations by (i) controlling concurrency of the merge operations, (ii) distributing initiation of the merge operations (i.e., staggering the merge operations), and (iii) pacing execution of merge messages to limit the continuous runtime of the merge operations.

公开(公告)号：US20170192892A1

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

申请号：US14989392

申请日：2016-01-06

Applicant: NetApp, Inc.

Inventor： Anshul Pundir ,  Ashwin Pednekar ,  Ling Zheng ,  Michael L. Federwisch

IPC: G06F12/08

CPC classification number: G06F12/128 ,  G06F3/06 ,  G06F12/0804 ,  G06F12/0873 ,  G06F12/122 ,  G06F12/123 ,  G06F2212/1008 ,  G06F2212/313

Abstract: A technique provides memory efficient caching of metadata managed by a volume layer of a storage input/output stack executing on one or more nodes of a cluster. Efficient caching of the metadata in a memory of a node may be realized through the use of a caching data structure, i.e., a page cache, configured to store a key-value pair, wherein the key is an extent key and the value is a metadata page containing the index entries. The page cache illustratively includes two data structures configured to maintain the properties of Least Recently Used (LRU) and Least Frequently Used (LFU) for the cache. The first data structure is a hash table that stores a dense tree metadata page (value) indexed by the extent key. The second data structure is a recycle queue that controls the metadata page stored in the hash table based on spatial and temporal locality of the page.

公开(公告)号：US20160139838A1

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

申请号：US14546214

申请日：2014-11-18

Applicant: NetApp, Inc.

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

IPC: G06F3/06

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

Abstract: A three-way merge technique efficiently updates metadata in accordance with a three-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 three-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.

Abstract translation: 三向合并技术根据在集群的一个或多个节点上执行的存储输入/输出（I / O）栈的卷层管理的三向合并操作来有效地更新元数据。 元数据体现为从主机可访问的逻辑单元（LUN）的逻辑块地址（LBA）到持久扩展密钥的映射，并且被组织为多级密集树。 这些映射被组织成使得较高级别的密集树包含比下一个较低级别更近的映射，即紧接在下面的级别。 三次合并操作是通过在单次迭代中合并所有三个级别的映射内容来更新密集树的卷元数据映射的有效（即优化的）方法，而不是将第一级的内容与 在双向合并操作的第一迭代中的第二级的内容，然后在操作的第二次迭代中将第一次迭代的结果与第三级的内容合并。

公开(公告)号：US20160110392A1

公开(公告)日：2016-04-21

申请号：US14978290

申请日：2015-12-22

Applicant: NetApp, Inc.

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

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

公开(公告)号：US20160026652A1

公开(公告)日：2016-01-28

申请号：US14339890

申请日：2014-07-24

Applicant: NetApp, Inc.

Inventor： Ling Zheng

IPC: G06F17/30

CPC classification number: G06F17/30097 ,  G06F17/30159

Abstract: In one embodiment, as new blocks of data are written to storage devices of a storage system, fingerprints are generated for those new blocks and inserted as entries into a top level (L0) of a dense tree data structure. When L0 is filled, the contents from L0 may be merged with level 1 (L1). After the initial merge, new fingerprints are added to L0 until L0 fills up again, which triggers a new merge. Duplicate fingerprints in L0 and L1 are identified which, in turn, indicates duplicate data blocks. A post-processing deduplication operation is then performed to remove duplicate data blocks corresponding to the duplicate fingerprints. In a different embodiment, as new fingerprint entries are loaded into L0, those new fingerprints may be compared with existing fingerprints loaded into L0 and/or other levels to facilitate inline deduplication to identify duplicate fingerprints and subsequently perform the deduplication operation.

Abstract translation: 在一个实施例中，随着新的数据块被写入存储系统的存储设备，为这些新块生成指纹并作为条目插入密集树数据结构的顶层（L0）。 当L0被填满时，L0的内容可能与1级（L1）合并。 初始合并后，新的指纹将添加到L0，直到L0再次填满，触发新的合并。 识别L0和L1中的重复指纹，进而指示重复的数据块。 然后执行后处理重复数据删除操作以去除与重复指纹相对应的重复数据块。 在不同的实施例中，当新指纹条目被加载到L0中时，可以将这些新指纹与加载到L0和/或其他级别的现有指纹进行比较，以便于内联重复数据删除以识别重复指纹，并随后执行重复数据删除操作。

公开(公告)号：US20150142817A1

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

申请号：US14084137

申请日：2013-11-19

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Blake H. Lewis

IPC: G06F17/30

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

Abstract: In one embodiment, a node of a cluster executing a storage input/output (I/O) stack having a volume layer, stores a multi-level dense tree metadata structure. Each level of the dense tree metadata structure includes volume metadata entries for storing volume metadata. One or more non-volatile logs (NVLogs) are updated. The one or more NVLogs including a volume layer log configured to record changes to the volume metadata, wherein volume metadata entries inserted into a top-level of the dense tree metadata structure are recorded in the volume layer log. The node writes volume metadata entries from the volume layer log to one or more storage devices to be stored as extents.

Abstract translation: 在一个实施例中，执行具有卷层的存储输入/输出（I / O）堆栈的集群的节点存储多级密集树元数据结构。 密集树元数据结构的每一级包括用于存储卷元数据的卷元数据条目。 一个或多个非易失性日志（NVLogs）被更新。 一个或多个NVLog，包括配置为记录卷元数据的更改的卷层日志，其中插入到密集树元数据结构的顶层的卷元数据条目被记录在卷层日志中。 节点将卷元数据条目从卷层日志写入一个或多个存储设备以作为扩展区存储。