公开(公告)号：US11836134B2

公开(公告)日：2023-12-05

申请号：US15927030

申请日：2018-03-20

Applicant: VMware, Inc.

Inventor： Abhishek Gupta ,  Rob T. Johnson ,  Srinath Premachandran ,  Richard P. Spillane ,  Sandeep Rangaswamy ,  Jorge Guerra Delgado ,  Kapil Chowksey ,  Wenguang Wang

IPC: G06F16/2453 ,  G06F9/54 ,  G06F16/17 ,  G06F16/27 ,  G06F16/22

CPC classification number: G06F16/24547 ,  G06F9/544 ,  G06F16/17 ,  G06F16/2246 ,  G06F16/27

Abstract: Exemplary methods, apparatuses, and systems include a file system process obtaining locks on a first node and a second node in a tree structure, with the second node being a child node of the first node. The file system process determines a quantity of child nodes of the second. While holding the locks on the first and second nodes, the file system determines whether to proactively split or merge the second node. In response to determining that the quantity of child nodes is within a first range, the file system process splits the second node. If the file system process determines that the quantity of child nodes is within a second range, the file system process merges the second node.

公开(公告)号：US11061881B2

公开(公告)日：2021-07-13

申请号：US16184861

申请日：2018-11-08

Applicant: VMware, Inc.

Inventor： Robert T Johnson ,  Abhishek Gupta ,  Jorge Guerra Delgado ,  Ittai Abraham ,  Richard P Spillane ,  Srinath Premachandran ,  Sandeep Rangaswamy ,  Kapil Chowksey

IPC: G06F16/22

Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.

公开(公告)号：US20190026042A1

公开(公告)日：2019-01-24

申请号：US15653249

申请日：2017-07-18

Applicant: VMware, Inc.

Inventor： Abhishek Gupta ,  Jorge Guerra Delgado ,  Sandeep Rangaswamy ,  Srinath Premachandran ,  Pascal Renauld

IPC: G06F3/06 ,  G06F17/30

Abstract: Techniques for enabling deduplication-aware load balancing in a distributed storage system are provided. In one set of embodiments, a node of the distributed storage system can receive an I/O (Input/Output) request pertaining to a data block of a storage object stored on a local storage component of the node. The node can further determine whether the I/O request requires insertion of a new entry into a deduplication hash table associated with the local storage component or deletion of an existing entry from the deduplication hash table. If the I/O request requires insertion of a new hash table entry, the node can add an identifier of the data block into a probabilistic data structure associated with the local storage component, where the probabilistic data structure is configured to maintain information regarding distinct data blocks that are likely present in the local storage component. Alternatively, if the I/O request requires deletion of an existing hash table entry, the node can remove the identifier of the data block from the probabilistic data structure.

公开(公告)号：US20170262465A1

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

申请号：US15068988

申请日：2016-03-14

Applicant: VMware, Inc.

Inventor： Edward J. Goggin ,  Sandeep Rangaswamy ,  Kiran Joshi ,  Srinath Premachandran ,  Gopala Suryanarayana ,  Radu Berinde ,  Wenguang Wang ,  Jorge Guerra Delgado ,  Jin Zhang ,  Radhika Vullikanti

IPC: G06F17/30 ,  H04L29/08

CPC classification number: G06F16/1748 ,  H04L67/1004 ,  H04L67/1097

Abstract: In accordance with the present disclosure, files may be deduplicated in a distributed storage system having a plurality of storage volumes. A uniqueness metric for each file may indicate a degree of deduplication of the respective data files in the given storage volume. The uniqueness metric may be used to identify files for rebalancing in the distributed storage system. The uniqueness metric may be efficiently calculated with enough accuracy using a sampling methodology.

公开(公告)号：US11461027B2

公开(公告)日：2022-10-04

申请号：US15653249

申请日：2017-07-18

Applicant: VMware, Inc.

Inventor： Abhishek Gupta ,  Jorge Guerra Delgado ,  Sandeep Rangaswamy ,  Srinath Premachandran ,  Pascal Renauld

IPC: G06F16/21 ,  G06F3/06 ,  G06F16/215

Abstract: Techniques for enabling deduplication-aware load balancing in a distributed storage system are provided. In one set of embodiments, a node of the distributed storage system can receive an I/O (Input/Output) request pertaining to a data block of a storage object stored on a local storage component of the node. The node can further determine whether the I/O request requires insertion of a new entry into a deduplication hash table associated with the local storage component or deletion of an existing entry from the deduplication hash table. If the I/O request requires insertion of a new hash table entry, the node can add an identifier of the data block into a probabilistic data structure associated with the local storage component, where the probabilistic data structure is configured to maintain information regarding distinct data blocks that are likely present in the local storage component. Alternatively, if the I/O request requires deletion of an existing hash table entry, the node can remove the identifier of the data block from the probabilistic data structure.

公开(公告)号：US11010334B2

公开(公告)日：2021-05-18

申请号：US15947072

申请日：2018-04-06

Applicant: VMware, Inc.

Inventor： Jorge Guerra Delgado ,  Richard P. Spillane ,  Kapil Chowksey ,  Sandeep Rangaswamy ,  Abhishek Gupta ,  Srinath Premachandran

IPC: G06F16/11 ,  G06F9/455 ,  G06F16/188 ,  G06F16/22 ,  G06F16/23

Abstract: Embodiments described herein involve improved management of snapshots of a file system. Embodiments include copying a first root node of a first snapshot to a second snapshot, the second snapshot referencing other nodes of the first snapshot. Embodiments further include incrementing reference counts of the other nodes of the first snapshot. Embodiments further include adding a storage address of the first root node to a list. Embodiments further include, each time that a copy on write operation is performed for a node of the other nodes, adding a storage address of the node to the list and decrementing the reference count of the node. Embodiments further include iterating through the list and, for each storage address in the list, decrementing the reference count of the node corresponding to the storage address and, if the reference count of the node reaches zero, freeing storage space at the storage address.

公开(公告)号：US20190188098A1

公开(公告)日：2019-06-20

申请号：US15844539

申请日：2017-12-16

Applicant: VMware, Inc.

Inventor： Abhishek Gupta ,  Jorge Guerra Delgado ,  Kapil Chowksey ,  Sandeep Rangaswamy ,  Srinath Premachandran

IPC: G06F11/20 ,  G06F3/06

CPC classification number: G06F11/2069 ,  G06F3/065 ,  G06F3/067 ,  G06F11/2082 ,  G06F2201/84

Abstract: The subject matter described herein is generally directed towards tracking and recovering a disk allocation state. An on-disk log of operations is maintained to describe operations performed to an in-memory partial reference count map. Upon a crash of a host computing device during a checkpoint operation to an on-disk complete reference count map, the on-disk log of operations is used to undo and then redo the operations, or just redo the operations. In this manner, a disk allocation state prior to the crash is recreated in the on-disk complete reference count map with atomicity and crash consistency.

公开(公告)号：US09977599B2

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

申请号：US14993827

申请日：2016-01-12

Applicant: VMware, Inc.

Inventor： Jorge Guerra Delgado ,  Kiran Joshi ,  Edward J Goggin ,  Srinath Premachandran ,  Sandeep Rangaswamy

IPC: G06F3/06

CPC classification number: G06F3/0608 ,  G06F3/0641 ,  G06F3/0665 ,  G06F3/0683

Abstract: Techniques for implementing data deduplication in conjunction with thick and thin provisioning of storage objects are provided. In one embodiment, a system can receive a write request directed to a storage object stored by the system and can determine whether the storage object is a thin or thick object. If the storage object is a thin object, the system can calculate a usage value by adding a total amount of physical storage space used in the system to a total amount of storage space reserved for thick storage objects in the system and further subtracting a total amount of reserved storage space for the thick storage objects that are filled with unique data. The system can then reject the write request if the usage value is not less than the total storage capacity of the system.

公开(公告)号：US20160350006A1

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

申请号：US14726572

申请日：2015-05-31

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Radu Berinde ,  Christos Karamanolis ,  Jorge Guerra Delgado ,  Srinath Premachandran

IPC: G06F3/06

CPC classification number: G06F3/0608 ,  G06F3/0619 ,  G06F3/0641 ,  G06F3/065 ,  G06F3/067 ,  G06F17/30156

Abstract: A deduplication storage system with snapshot and clone capability includes storing logical pointer objects and organizing a first set of the logical pointer objects into a hierarchical structure. A second set of the logical pointer objects may be associated with corresponding logical data blocks of a client data object. The second set of the logical pointer objects may point to physical data blocks having deduplicated data that comprise data of the corresponding logical data blocks. Some of the logical pointer objects in the first set may point to the logical pointer objects in the second set, so that the hierarchical structure represents the client data object. A root of the hierarchical structure may be associated with the client data object. A snapshot or clone may be created by making a copy of the root and associating the copied root with the snapshot or clone.

Abstract translation: 具有快照和克隆功能的重复数据删除存储系统包括存储逻辑指针对象并将第一组逻辑指针对象组织成层次结构。 第二组逻辑指针对象可以与客户机数据对象的相应逻辑数据块相关联。 第二组逻辑指针对象可以指向具有包括相应逻辑数据块的数据的重复数据删除数据的物理数据块。 第一组中的一些逻辑指针对象可以指向第二组中的逻辑指针对象，使得层次结构表示客户端数据对象。 层次结构的根可以与客户端数据对象相关联。 可以通过创建根的副本并将复制的根与快照或克隆相关联来创建快照或克隆。

公开(公告)号：US11474724B2

公开(公告)日：2022-10-18

申请号：US15880391

申请日：2018-01-25

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Christos Karamanolis ,  Srinath Premachandran

IPC: G06F3/06 ,  G06F12/10

Abstract: A method includes obtaining a plurality of representations corresponding respectively to a plurality of blocks of data stored on a source node. A plurality of data pairs are sent to a destination node, where each data pair includes a logical address associated with a block of data from the plurality of blocks of data and the corresponding representation of the block of data. A determination is made whether the blocks of data associated with the respective logical addresses are duplicates of data stored on the destination node. In accordance with an affirmative determination, a reference to a physical address of the block of data stored on the destination node is stored. In accordance with a negative determination, an indication that the data corresponding to the respective logical address is not a duplicate is stored. The data indicated as not being a duplicate is written to the destination node.