专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

61. 发明申请

US20150081966A1 DENSE TREE VOLUME METADATA ORGANIZATION 有权
标题翻译： DENSE TREE VOLUME METADATA组织
公开(公告)号：US20150081966A1
公开(公告)日：2015-03-19
申请号：US14027994
申请日：2013-09-16
申请人： NetApp, Inc.
发明人： Ling Zheng , Blake H. Lewis , Kayuri H. Patel
IPC分类号： G06F3/06
CPC分类号： G06F17/30327 , G06F3/0611 , G06F3/0619 , G06F3/0638 , G06F3/0641 , G06F3/0655 , G06F3/0665 , G06F3/067 , G06F3/0689 , G06F17/30 , G06F17/30292
摘要： 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.
摘要翻译：在一个实施例中，耦合到一个或多个存储设备的节点执行具有体积层的存储输入/输出（I / O）堆栈。卷层管理体现为从逻辑单元（LUN）的偏移到与一个或多个存储设备上的范围的存储位置相关联的扩展密钥的映射的卷元数据。卷元数据被保持为表示连续时间点的密集树元数据结构。密集树元数据结构具有多个层次，其中密集树元数据结构的顶层表示较新的卷元数据更改，密集树元数据结构的下降层表示较旧的卷元数据更改。节点通过从密级树元数据结构中的顶层到下行级别进行搜索来访问对卷元数据的最新版本的更改。

62. 发明公开

US20240273064A1 REDUCING STABLE DATA EVICTION WITH SYNTHETIC BASELINE SNAPSHOT AND EVICTION STATE REFRESH 审中-公开
公开(公告)号：US20240273064A1
公开(公告)日：2024-08-15
申请号：US18641602
申请日：2024-04-22
申请人： NetApp, Inc.
发明人： Ajay Pratap Singh Kushwah , Ling Zheng , Sharad Jain
IPC分类号： G06F16/11 , G06F11/14 , G06F12/121 , G06F16/13 , H04L67/568
CPC分类号： G06F16/128 , G06F11/1448 , G06F11/1464 , G06F12/121 , G06F16/13 , H04L67/568
摘要： 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.

63. 发明授权

US11977461B2 Incremental restore of a virtual machine 有权
公开(公告)号：US11977461B2
公开(公告)日：2024-05-07
申请号：US18190172
申请日：2023-03-27
申请人： NetApp Inc.
发明人： Abhishek Naidu , Jose Mathew , Ling Zheng , Ravindra Kuramkote
IPC分类号： G06F11/14 , G06F3/06 , G06F9/455
CPC分类号： G06F11/1469 , G06F3/0619 , G06F3/065 , G06F3/0664 , G06F3/0673 , G06F9/45558 , G06F11/1451 , G06F11/1458 , G06F11/1464 , G06F11/1484 , G06F2009/45562 , G06F2009/45575 , G06F2201/80 , G06F2201/815 , G06F2201/84
摘要： Techniques are provided for incrementally restoring a virtual machine hosted by a computing environment. In response to receiving an indication that the virtual machine is to be incrementally restored, a snapshot of the virtual machine may be created while the virtual machine is shut down into an off state. The snapshot is transmitted to a storage environment as a common snapshot. The snapshot and the common snapshot are common snapshots comprising a same representation of the virtual machine. The common snapshot and a prior snapshot of the virtual machine are evaluated to identify a data difference of the virtual machine between the common snapshot and the prior snapshot. An incremental restore is performed of the virtual machine by transmitting the data difference from the storage environment to the computing environment to restore the virtual machine to a state represented by the prior snapshot.

64. 发明申请

US20210004353A1 SNAPSHOT METADATA ARRANGEMENT FOR EFFICIENT CLOUD INTEGRATED DATA MANAGEMENT 有权
公开(公告)号：US20210004353A1
公开(公告)日：2021-01-07
申请号：US17029920
申请日：2020-09-23
申请人： NetApp, Inc.
发明人： Sharad Jain , Hrishikesh Ashok Tapaswi , Ling Zheng , Onkar Bhat , Akhil Kaushik
IPC分类号： G06F16/11 , G06F16/13 , G06F11/14
摘要： 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.

65. 发明授权

US10789134B2 NVRAM loss handling 有权
公开(公告)号：US10789134B2
公开(公告)日：2020-09-29
申请号：US15130280
申请日：2016-04-15
申请人： NetApp, Inc.
发明人： Ling Zheng , Jeffrey S. Kimmel
IPC分类号： G06F11/14
摘要： 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.

66. 发明授权

US10635548B2 Data block name based efficient restore of multiple files from deduplicated storage 有权
公开(公告)号：US10635548B2
公开(公告)日：2020-04-28
申请号：US15795551
申请日：2017-10-27
申请人： NetApp, Inc.
发明人： Ajay Pratap Singh Kushwah , Ling Zheng , Sharad Jain
IPC分类号： G06F16/17 , G06F11/14 , G06F16/11 , G06F16/174
CPC分类号： G06F11/1469 , G06F11/1453 , G06F16/125 , G06F16/1748 , G06F2201/80 , G06F2201/805 , G06F2201/82 , G06F2201/84
摘要： A storage appliance can be designed to facilitate efficient restore of multiple backed up files in a system that allows files to share data blocks. A data management application or storage OS names data blocks and communicates those names to the storage appliance when backing up to or through the storage appliance. The storage appliance can leverage the data block names when restoring a group of files by restoring at data block granularity instead of file granularity. Restoring at the granularity of the data blocks by their names allows the storage appliance to avoid repeatedly sending a same data block to the restore requestor (e.g., a storage OS or data management application) while still instructing the restore requestor how to reconstruct the corresponding file(s) with mappings between valid data ranges and the named data blocks.

67. 发明授权

US10365838B2 N-way merge technique for updating volume metadata in a storage I/O stack 有权
公开(公告)号：US10365838B2
公开(公告)日：2019-07-30
申请号：US15820004
申请日：2017-11-21
申请人： NetApp, Inc.
发明人： Janice D'Sa , Ling Zheng , Blake H. Lewis
IPC分类号： G06F3/06 , H04L29/08
摘要： 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.

68. 发明授权

US10346354B2 Reducing stable data eviction with synthetic baseline snapshot and eviction state refresh 有权
公开(公告)号：US10346354B2
公开(公告)日：2019-07-09
申请号：US15338272
申请日：2016-10-28
申请人： NetApp, Inc.
发明人： Ajay Pratap Singh Kushwah , Ling Zheng , Sharad Jain
IPC分类号： G06F16/11 , G06F16/13 , H04L29/08 , G06F12/121 , G06F11/14
摘要： 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.

69. 发明授权

US09836229B2 N-way merge technique for updating volume metadata in a storage I/O stack 有权
公开(公告)号：US09836229B2
公开(公告)日：2017-12-05
申请号：US14546214
申请日：2014-11-18
申请人： NetApp, Inc.
发明人： Janice D'Sa , Ling Zheng , Blake H. Lewis
IPC分类号： G06F3/06 , H04L29/08
CPC分类号： G06F3/0619 , G06F3/0607 , G06F3/0626 , G06F3/0644 , G06F3/0665 , G06F3/067 , G06F3/0689 , H04L67/1097
摘要： 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.

70. 发明授权

US09798728B2 System performing data deduplication using a dense tree data structure 有权
公开(公告)号：US09798728B2
公开(公告)日：2017-10-24
申请号：US14339890
申请日：2014-07-24
申请人： NetApp, Inc.
发明人： Ling Zheng
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30097 , G06F17/30159
摘要： 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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式