公开(公告)号：WO2018081737A1

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

申请号：PCT/US2017/059090

申请日：2017-10-30

Applicant: NETAPP, INC.

Inventor： JAIN, Sharad ,  TAPASWI, Hrishikesh, Ashok ,  ZHENG, Ling ,  BHAT, Onkar ,  KAUSHIK, Akhil

IPC: G06F11/14

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.

Abstract translation: 存储设备将快照数据和快照元数据安排到不同的结构中，并且排列快照元数据以促进高效的快照处理，这可以用于快照管理或快照恢复。 存储设备根据永久增量配置接收快照，并将快照元数据安排到不同类型的记录中。 存储设备将这些记录存储在为每个定义的数据收集（例如，卷）维护的键值存储中。 存储设备将快照元数据安排到inode信息的记录中，记录目录信息以及将数据块的源描述符映射到快照文件描述符的记录。 存储设备使用本地生成的快照标识符作为记录的键前缀，以符合键值存储的排序约束，从而可以利用键值存储的效率。 快照元数据安排有助于高效的快照恢复，文件恢复和快照回收。

公开(公告)号：WO2018081729A1

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

申请号：PCT/US2017/059079

申请日：2017-10-30

Applicant: NETAPP, INC.

Inventor： KUSHWAH, Ajay Pratap, Singh ,  ZHENG, Ling ,  JAIN, Sharad

IPC: G06F11/14 ,  G06F17/30

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.

Abstract translation: 利用永久增量快照配置和典型的高速缓存策略（例如，最近最少使用），存储设备可以驱逐较旧快照的稳定数据块，可能是快照基线的未改变的数据块。 如果稳定的数据块已被逐出，则恢复最近的快照将承受下载用于恢复最近快照的稳定块的时间损失。 创建合成基线快照并刷新稳定数据块的逐出数据可以避免逐出稳定数据块并降低违反恢复时间目标的风险。

公开(公告)号：EP3532935B1

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

申请号：EP17812099.4

申请日：2017-10-30

Applicant: Netapp, Inc.

Inventor： JAIN, Sharad ,  TAPASWI, Hrishikesh, Ashok ,  ZHENG, Ling ,  BHAT, Onkar ,  KAUSHIK, Akhil

IPC: G06F11/14

公开(公告)号：WO2019222201A9

公开(公告)日：2019-11-21

申请号：PCT/US2019/032199

申请日：2019-05-14

Applicant: NETAPP, INC.

Inventor： ANDKEN, Benjamin, Bradford ,  KYATHANAHALLI, Sumeeth, Channaveerappa ,  JAIN, Sharad

IPC: G06F17/00 ,  G06F16/00 ,  G06F16/18

Abstract: A method, non-transitory computer readable medium, and device that assists with managing cloud storage includes identifying a portion of data in a data unit identified for deletion in the metadata. The identified portion of the data identified for delete is compare to a threshold amount. Deletion of the data unit from a first storage object is deferred when the determined portion of data identified for deletion is less than the threshold amount. A second storage object with a portion of data unmarked for deletion in the data unit is generated when the determined portion of data marked for deletion is equal to the threshold amount, wherein the second storage object has a same identifier as the first storage object.

公开(公告)号：EP3532934A1

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

申请号：EP17798053.9

申请日：2017-10-30

Applicant: Netapp, Inc.

Inventor： KUSHWAH, Ajay Pratap, Singh ,  ZHENG, Ling ,  JAIN, Sharad

IPC: G06F11/14 ,  G06F17/30

公开(公告)号：EP3532934B1

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

申请号：EP17798053.9

申请日：2017-10-30

Applicant: Netapp, Inc.

Inventor： KUSHWAH, Ajay Pratap, Singh ,  ZHENG, Ling ,  JAIN, Sharad

IPC: G06F11/14

公开(公告)号：EP3477481A3

公开(公告)日：2020-03-25

申请号：EP18203064.3

申请日：2018-10-29

Applicant: NetApp, Inc.

Inventor： KUSHWAH, Ajay Pratap Singh ,  ZHENG, Ling ,  JAIN, Sharad

IPC: G06F11/14 ,  G06F16/11 ,  G06F16/174

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

公开(公告)号：WO2019222201A1

公开(公告)日：2019-11-21

申请号：PCT/US2019/032199

申请日：2019-05-14

Applicant: NETAPP, INC.

Inventor： ANDKEN, Benjamin, Bradford ,  KYATHANAHALLI, Sumeeth, Channaveerappa ,  JAIN, Sharad

IPC: G06F17/00 ,  G06F16/00 ,  G06F16/18

Abstract: A method, non-transitory computer readable medium, and device that assists with managing cloud storage includes identifying a portion of data in a data unit identified for deletion in the metadata. The identified portion of the data identified for delete is compare to a threshold amount. Deletion of the data unit from a first storage object is deferred when the determined portion of data identified for deletion is less than the threshold amount. A second storage object with a portion of data unmarked for deletion in the data unit is generated when the determined portion of data marked for deletion is equal to the threshold amount, wherein the second storage object has a same identifier as the first storage object.

公开(公告)号：WO2017132623A1

公开(公告)日：2017-08-03

申请号：PCT/US2017/015509

申请日：2017-01-27

Applicant: NETAPP, INC.

Inventor： JAIN, Sharad ,  NAGARAJ, Sudhindra, Prasad Tirupati ,  HANGUD, Vinay

IPC: G06F3/06

CPC classification number: G06F3/0631 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0644 ,  G06F3/0671 ,  G06F3/0673 ,  G06F3/0683 ,  G06F17/30339

Abstract: Embodiments address the problem of disk fragmentation by using the heuristics of write operations to assign block sizes. As write requests are received, a storage system may register a size of the write request. Using the registered sizes, the storage system may identify one or more clusters of sizes at which write requests are particularly prevalent. The storage system may calculate a distribution or variance for block sizes centered on each cluster. The distribution or variance may be used to distribute the block sizes such that the block sizes change by a small amount in the vicinity of the cluster, and by a larger amount as the blocks move away from the center of the cluster. When it comes time to allocate new blocks, the clusters and distribution may be consulted to determine what sizes of blocks to allocate, and how many blocks of each size.

Abstract translation: 实施例通过使用写入操作的启发式来分配块大小来解决磁盘碎片化的问题。 当接收到写请求时，存储系统可以注册写请求的大小。 使用所登记的大小，存储系统可以识别写入请求特别普遍的一个或多个大小簇。 存储系统可以计算以每个集群为中心的块大小的分布或方差。 可以使用分布或方差来分布块大小，使得块大小在集群附近以少量变化，并且随着块从集群中心移开而变大量。 当需要分配新块时，可以查询簇和分布以确定要分配的块的大小以及每个大小的块数。

公开(公告)号：EP3532935A1

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

申请号：EP17812099.4

申请日：2017-10-30

Applicant: Netapp, Inc.

Inventor： JAIN, Sharad ,  TAPASWI, Hrishikesh, Ashok ,  ZHENG, Ling ,  BHAT, Onkar ,  KAUSHIK, Akhil

IPC: G06F11/14