-
51.发明申请公开(公告)号：US20160070714A1
公开(公告)日：2016-03-10
申请号：US14483012
申请日：2014-09-10
Applicant: NetApp, Inc.
Inventor： Janice D'Sa , Anshul Pundir , Srinath Krishnamachari , Ling Zheng
IPC: G06F17/30
CPC classification number: G06F16/1748 , G06F11/1471 , G06F16/2246
Abstract: A low-overhead merge technique enables restart of a merge operation with minimal logging of state information relating to progress of the merge operation by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. The technique enables restart of the merge operation by ensuring that metadata, i.e., metadata pages, generated during the merge operation is not subject to de-duplication by providing a unique value in each metadata page that distinguishes the page, i.e., renders the page distinct or “unique”, from other metadata pages in an extent store. In addition, the technique ensures that a reference count on each metadata page is a value denoting a lack of de-duplication. To that end, the extent store layer is configured to not increment the reference count for a metadata page if, during the merge operation, the page is identical (and thus subject to deduplication) to an existing metadata page in the extent store.
Abstract translation: 低开销合并技术使得可以通过对在集群的一个或多个节点上执行的存储输入/输出（I / O）堆栈的卷层进行合并操作的进展的状态信息的最小记录来重新启动合并操作。 。 该技术通过确保在合并操作期间生成的元数据页面不受重复数据删除的影响，从而通过在每个元数据页面中提供唯一的值来区分页面，即，使页面不同 或“唯一”，从范围存储中的其他元数据页面。 此外，该技术确保每个元数据页面上的引用计数是表示缺少重复数据删除的值。 为此，如果在合并操作期间页面与扩展存储区中的现有元数据页面相同（因此遭受重复数据删除），则扩展区存储层被配置为不递增元数据页面的引用计数。
-
52.发明授权Systems, methods, and computer program products for scheduling processing to achieve space savings 有权用于调度处理的系统，方法和计算机程序产品，以实现节省空间公开(公告)号：US09280571B2
公开(公告)日：2016-03-08
申请号：US14460032
申请日：2014-08-14
Applicant: NetApp, Inc.
Inventor： Vinod Kumar Daga , Craig Johnston , Ling Zheng
IPC: G06F17/30
CPC classification number: G06F17/30303 , G06F17/30079 , G06F17/3015 , G06F17/30156
Abstract: A method performed in a system that has a plurality of volumes stored to storage hardware, the method including generating, for each of the volumes, a respective space saving potential iteratively over time and scheduling space saving operations among the plurality of volumes by analyzing each of the volumes for space saving potential and assigning priority of resources based at least in part on space saving potential.
Abstract translation: 一种在具有存储到存储硬件的多个卷的系统中执行的方法，所述方法包括针对每个卷生成随时间迭代的相应的空间节省潜力，并且通过分析每个卷中的每个 节省空间的潜力，并至少部分依赖节省空间的潜力来分配资源的优先级。
-
公开(公告)号：US09268502B2
公开(公告)日：2016-02-23
申请号：US14027994
申请日：2013-09-16
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis , Kayuri H. Patel
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）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。 卷元数据被保持为表示连续时间点的密集树元数据结构。 密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。 节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。
-
公开(公告)号：US09256378B2
公开(公告)日：2016-02-09
申请号：US13901385
申请日：2013-05-23
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis , Daniel W. Ting , Robert M. English , Stephen L. Manley
CPC classification number: G06F3/0641 , G06F3/0608 , G06F3/0683
Abstract: A method for sharing data blocks in a hierarchical file system in a storage server includes allocating a plurality of data blocks in the file system, and sharing data blocks in the file system, without using a persistent point-in-time image, to avoid duplication of data blocks. A method for identifying data blocks that can be shared includes computing a fingerprint for each of multiple data blocks to be written to a storage facility and storing the fingerprint with information identifying the data block in an entry in a set of metadata. The set of metadata is used to identify data blocks which are duplicates.
Abstract translation: 一种用于在存储服务器中的分层文件系统中共享数据块的方法包括在文件系统中分配多个数据块，并且在不使用持久时间点图像的情况下共享文件系统中的数据块，以避免重复 的数据块。 一种用于识别可共享的数据块的方法包括：计算要写入存储设施的多个数据块中的每一个的指纹，以及将标识数据块的信息存储在一组元数据中的条目中。 元数据集用于识别重复的数据块。
-
公开(公告)号：US20160034489A1
公开(公告)日：2016-02-04
申请号：US14880183
申请日：2015-10-09
Applicant: NetApp, Inc.
Inventor： Blake Lewis , Ling Zheng , Craig Johnston , Vinod Daga
IPC: 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: 系统可以为不同优先级的重复数据删除请求维护多个队列。 系统还可以指定存储单元的优先级。 重复数据消除请求的调度优先级是基于重复数据消除请求中指示的存储单元的优先级和重复数据删除请求的触发。
-
Patent Agency Ranking
公开(公告)号：US09201918B2
公开(公告)日：2015-12-01
申请号：US14084137
申请日：2013-11-19
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Blake H. Lewis
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，包括配置为记录卷元数据的更改的卷层日志，其中插入到密集树元数据结构的顶层的卷元数据条目被记录在卷层日志中。 节点将卷元数据条目从卷层日志写入一个或多个存储设备以作为扩展区存储。
-
公开(公告)号：US12099467B2
公开(公告)日：2024-09-24
申请号：US18333627
申请日：2023-06-13
Applicant: NetApp, Inc.
Inventor： Sharad Jain , Hrishikesh Ashok Tapaswi , Ling Zheng , Onkar Bhat , Akhil Kaushik
CPC classification number: G06F16/128 , G06F11/1448 , G06F11/1464 , G06F11/1469 , G06F16/13 , G06F2201/805 , G06F2201/84
Abstract: A storage appliance arranges snapshot data and snapshot metadata into different structures, and arranges the snapshot metadata to facilitate efficient snapshot manipulation, which may be for snapshot management or snapshot restore. The storage appliance receives snapshots according to a forever incremental configuration and arranges snapshot metadata into different types of records. The storage appliance stores these records in key-value stores maintained for each defined data collection (e.g., volume). The storage appliance arranges the snapshot metadata into records for inode information, records for directory information, and records that map source descriptors of data blocks to snapshot file descriptors. The storage appliance uses a locally generated snapshot identifier as a key prefix for the records to conform to a sort constrain of the key-value store, which allows the efficiency of the key-value store to be leveraged. The snapshot metadata arrangement facilitates efficient snapshot restore, file restore, and snapshot reclamation.
-
公开(公告)号：US20240275814A1
公开(公告)日：2024-08-15
申请号：US18168739
申请日：2023-02-14
Applicant: NetApp, Inc.
Inventor： Tijin George , Vijay Srinath , Ling Zheng
CPC classification number: H04L63/1466 , G06F16/125 , G06F16/128 , H04L63/1416 , H04L63/1425
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.
-
59.发明授权公开(公告)号：US11966361B2
公开(公告)日：2024-04-23
申请号：US17536515
申请日：2021-11-29
Applicant: NetApp Inc.
Inventor： Ajay Pratap Singh Kushwah , Ling Zheng , Sharad Jain
IPC: G06F16/11 , G06F11/14 , G06F12/121 , G06F16/13 , H04L67/568
CPC classification number: G06F16/128 , G06F11/1448 , G06F11/1464 , G06F12/121 , G06F16/13 , H04L67/568
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.
-
公开(公告)号：US20240118977A1
公开(公告)日：2024-04-11
申请号：US18541143
申请日：2023-12-15
Applicant: NetApp, Inc.
Inventor： Ling Zheng , Atul Ramesh Pandit , Tijin George , Ravindra Ramachandraiah Kuramkote
IPC: G06F11/14
CPC classification number: G06F11/1451 , G06F11/1458
Abstract: Techniques are provided for incremental backup to an object store. A request may be received from an application to perform a backup from a volume hosted by a node to a backup target within the object store. A set of changed files within the volume since a prior backup of the volume was performed to the backup target is identified, along with metadata associated with the set of changed files. The metadata is utilized to identify changed data blocks comprising data of the set of changed files that was modified since the prior backup. The changed data blocks are backed up to the object store.
-
-
-
-
-
-
-
-
-
Search Results
100
records
(took 0.02 seconds)
