公开(公告)号：US20170032013A1

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

申请号：US14876460

申请日：2015-10-06

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Michael L. Federwisch ,  Blake H. Lewis

IPC: G06F17/30

Abstract: A technique preserves efficiency for replication of data between a source node of a source cluster (“source”) and a destination node of a destination cluster (“destination”) of a clustered network. Replication in the clustered network may be effected by leveraging global in-line deduplication at the source to identify and avoid copying duplicate data from the source to the destination. To ensure that the copy of the data on the destination is synchronized with the data received at the source, the source creates a snapshot of the data for use as a baseline copy at the destination. Thereafter, new data received at the source that differs from the baseline snapshot are transmitted and copied to the destination. In addition, the source and destination nodes negotiate to establish a mapping of name-to-data when transferring data (i.e., an extent) between the clusters. Illustratively, the name is an extent key for the extent, such that the negotiated mapping established by the source and destination is based on the extent key associated with the extent.

Abstract translation: 一种技术保留了源集群（“源”）的源节点与群集网络的目标集群（“目标”）的目标节点之间的数据复制的效率。 集群网络中的复制可以通过利用源上的全局在线重复数据消除来识别和避免将来自源的重复数据复制到目的地来实现。 为确保目标上的数据副本与源中接收到的数据同步，源将创建数据的快照，以用作目标的基准副本。 此后，源头接收到的与基线快照不同的新数据将被传送并复制到目的地。 另外，源和目的地节点协商在传送数据之间建立名称到数据的映射（即扩展）。 示例性地，该名称是该范围的扩展密钥，使得由源和目的地建立的协商映射基于与扩展相关联的扩展密钥。

公开(公告)号：US10565230B2

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

申请号：US14876460

申请日：2015-10-06

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Michael L. Federwisch ,  Blake H. Lewis

IPC: G06F16/27 ,  G06F16/11 ,  G06F16/28 ,  G06F16/2457

Abstract: A technique preserves efficiency for replication of data between a source node of a source cluster (“source”) and a destination node of a destination cluster (“destination”) of a clustered network. Replication in the clustered network may be effected by leveraging global in-line deduplication at the source to identify and avoid copying duplicate data from the source to the destination. To ensure that the copy of the data on the destination is synchronized with the data received at the source, the source creates a snapshot of the data for use as a baseline copy at the destination. Thereafter, new data received at the source that differs from the baseline snapshot are transmitted and copied to the destination. In addition, the source and destination nodes negotiate to establish a mapping of name-to-data when transferring data (i.e., an extent) between the clusters. Illustratively, the name is an extent key for the extent, such that the negotiated mapping established by the source and destination is based on the extent key associated with the extent.

公开(公告)号：US10108547B2

公开(公告)日：2018-10-23

申请号：US14989392

申请日：2016-01-06

Applicant: NetApp, Inc.

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

IPC: G06F12/12 ,  G06F12/0817 ,  G06F12/0868 ,  G06F12/122 ,  G06F12/123 ,  G06F12/128

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.

公开(公告)号：US20170315740A1

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

申请号：US15143324

申请日：2016-04-29

Applicant: NetApp, Inc.

Inventor： Christopher Joseph Corsi ,  Anshul Pundir ,  Michael L. Federwisch ,  Zhen Zeng

IPC: G06F3/06 ,  G06F13/42

CPC classification number: G06F13/4282 ,  G06F3/061 ,  G06F3/0641 ,  G06F3/0644 ,  G06F3/0688

Abstract: A technique paces and balances a flow of messages related to processing of input/output (I/O) requests between subsystems, such as layers of a storage input/output (I/O) stack, of one or more nodes of a cluster. The I/O requests may be directed to externally-generated user data, e.g., write requests generated by a host coupled to the cluster, and internally-generated metadata, e.g., write and delete requests generated by a volume layer of the storage I/O stack. The user data (and metadata) 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, which reference locations of the extents stored on storage devices, such as solid state drivers (SSDs), of a storage array coupled to the nodes. The I/O requests are received at a pacer of the volume layer configured to control delivery of the requests to an extent store layer of the storage I/O stack in a policy-dictated manner to enable processing and sequential storage of the user data and metadata on the SSDs of the storage array.

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