公开(公告)号：US10394660B2

公开(公告)日：2019-08-27

申请号：US14815064

申请日：2015-07-31

Applicant: NetApp, Inc.

Inventor： David Brittain Bolen ,  Suhas Prakash ,  Anshul Pundir ,  Ling Zheng

IPC: G06F3/06 ,  G06F11/14

Abstract: A snap restore technique efficiently restores snapshots of storage containers served by a storage input/output (I/O) stack executing on one or more nodes of a cluster. A Small Computer Systems Interface administration layer interacts with a volume layer of the storage I/O stack to manage and implement a snap restore procedure to restore one or more snapshots of a storage container. The storage container may be a logical unit (LUN) embodied as parent volume (active volume) and the snapshot may be represented as an independent volume embodied as read-only copy of the active volume. The snap restore procedure may be configured to allow restoration to a single snapshot of a LUN or restoration of a plurality of LUNs organized as a consistency group from a group of snapshots. Restoration of the LUN from a snapshot involves (i) creation of another independent volume embodied as a read-write copy (clone) of the snapshot, (ii) replacement of the (old) active volume with the clone, (iii) deletion of the old active volume, and (iv) mapping of the LUN to the clone (i.e., a new active volume).

公开(公告)号：US10282099B1

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

申请号：US15796467

申请日：2017-10-27

Applicant: NetApp, Inc.

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

IPC: G06F11/14 ,  G06F3/06

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.

公开(公告)号：US20180276090A1

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

申请号：US15995607

申请日：2018-06-01

Applicant: NetApp Inc.

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

IPC: 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.

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

公开(公告)号：US20170300388A1

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

申请号：US15130280

申请日：2016-04-15

Applicant: NetApp, Inc.

Inventor： Ling Zheng ,  Jeffrey S. Kimmel

IPC: G06F11/14 ,  G06F3/06

CPC classification number: G06F11/1464

Abstract: A technique restores a file system of a storage input/output (I/O) stack to a deterministic point-in-time state in the event of failure (loss) of non-volatile random access memory (NVRAM) of a node. The technique enables restoration of the file system to a safepoint stored on storage devices, such solid state drives (SSD), of the node with minimum data and metadata loss. The safepoint is a point-in-time during execution of I/O requests (e.g., write operations) at which data and related metadata of the write operations prior to the point-in-time are safely persisted on SSD such that the metadata relating to an image of the file system on SSD (on-disk) is consistent and complete. Upon reboot after NVRAM loss, the technique identifies (i) the most recent safepoint, as well as (ii) the inflight writes that were persistently stored on disk after the most recent safepoint. The data and metadata of those inflight writes are then deleted to place the on-disk file system to its state at the most recent safepoint.

公开(公告)号：US09569140B2

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

申请号：US14880183

申请日：2015-10-09

Applicant: NetApp, Inc.

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

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

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.

Abstract translation: 系统可以为不同优先级的重复数据删除请求维护多个队列。 系统还可以指定存储单元的优先级。 重复数据消除请求的调度优先级是基于重复数据消除请求中指示的存储单元的优先级和重复数据删除请求的触发。

公开(公告)号：US20170031774A1

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

申请号：US14815064

申请日：2015-07-31

Applicant: NetApp, Inc.

Inventor： David Brittain Bolen ,  Suhas Prakash ,  Anshul Pundir ,  Ling Zheng

IPC: G06F11/14 ,  G06F3/06

CPC classification number: G06F11/1458 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/067 ,  G06F11/00 ,  G06F2201/84

Abstract: A snap restore technique efficiently restores snapshots of storage containers served by a storage input/output (I/O) stack executing on one or more nodes of a cluster. A Small Computer Systems Interface administration layer interacts with a volume layer of the storage I/O stack to manage and implement a snap restore procedure to restore one or more snapshots of a storage container. The storage container may be a logical unit (LUN) embodied as parent volume (active volume) and the snapshot may be represented as an independent volume embodied as read-only copy of the active volume. The snap restore procedure may be configured to allow restoration to a single snapshot of a LUN or restoration of a plurality of LUNs organized as a consistency group from a group of snapshots. Restoration of the LUN from a snapshot involves (i) creation of another independent volume embodied as a read-write copy (clone) of the snapshot, (ii) replacement of the (old) active volume with the clone, (iii) deletion of the old active volume, and (iv) mapping of the LUN to the clone (i.e., a new active volume).

Abstract translation: 快速恢复技术有效地恢复由集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈服务的存储容器的快照。 小型计算机系统接口管理层与存储I / O堆栈的卷层交互以管理和实现快照恢复过程以恢复存储容器的一个或多个快照。 存储容器可以是体现为父卷（活动卷）的逻辑单元（LUN），并且快照可以被表示为体现为活动卷的只读副本的独立卷。 快照恢复过程可以被配置为允许恢复LUN的单个快照或从一组快照组织为一致性组的多个LUN的恢复。 从快照恢复LUN涉及（i）创建体现为快照的读写副本（克隆）的另一独立卷，（ii）使用克隆替换（旧）活动卷，（iii）删除 旧的活动卷，以及（iv）将LUN映射到克隆（即，新的活动卷）。

公开(公告)号：US20170010939A1

公开(公告)日：2017-01-12

申请号：US15272971

申请日：2016-09-22

Applicant: NetApp, Inc.

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

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

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）。

公开(公告)号：US09501359B2

公开(公告)日：2016-11-22

申请号：US14482618

申请日：2014-09-10

Applicant: NetApp, Inc.

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

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

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）。

公开(公告)号：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）堆栈，所述卷层，持久层和管理层进行交互以创建与 存储容器在一个或多个存储设备上。 在管理层的持久层收到复制创建开始消息。 持久层确保父卷的脏数据合并到父卷的副本中。 在创建父卷的副本期间，在持久层处收到的父卷的新数据将被阻止并入父卷的副本。 将复制创建开始消息的答复从持久层发送到管理层，以启动在卷层创建父卷的副本。