公开(公告)号：US20230325352A1

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

申请号：US17658133

申请日：2022-04-06

Applicant: VMware, Inc.

Inventor： Quanxing LIU ,  Wenguang WANG ,  Hardik Singh NEGI ,  Maxime AUSTRUY

IPC: G06F16/16 ,  G06F12/02

CPC classification number: G06F16/164 ,  G06F12/0246 ,  G06F2212/7201

Abstract: A method for metadata updating is provided. The method generally includes identifying a first segment containing a first physical block corresponding to a first PBA where content of a first data block was previously stored, determining a first key associated with the first data block, wherein the first key comprises a block address in a first key-value pair that maps the block address to the first PBA, traversing a B+ tree to locate a node storing a second key-value pair that maps the first key to a second PBA, determining the second PBA and the first PBA match, and based on the determination: updating, in the second key-value pair, the second PBA to a third PBA corresponding to a second physical block where the content of the first data block is currently stored or removing, in the second key-value pair, the second PBA.

公开(公告)号：US20220164125A1

公开(公告)日：2022-05-26

申请号：US17100663

申请日：2020-11-20

Applicant: VMware, Inc.

Inventor： Wenguang WANG ,  Petr VANDROVEC ,  Hardik Singh NEGI ,  Junlong GAO ,  Vamsi GUNTURU

IPC: G06F3/06

Abstract: A method for cleaning an object storage having a plurality of segments is provided. Each segment includes an identifier through which the segment is accessed. The method identifies a first segment in the plurality of segments. The first segment includes a first identifier and a first size. The method determines that a utilization ratio for the first segment is below a threshold. As a result, the method generates a second segment from the first segment, such that the second segment includes a second identifier that is the same as the first identifier and a second size that is smaller than the first size. The method then writes the second segment to the object storage.

公开(公告)号：US20230281180A1

公开(公告)日：2023-09-07

申请号：US18144797

申请日：2023-05-08

Applicant: VMware, Inc.

Inventor： Hardik Singh NEGI ,  Wenguang WANG ,  Eric KNAUFT

IPC: G06F16/22 ,  G06F16/28 ,  G06F16/2455 ,  G06F16/23

CPC classification number: G06F16/2246 ,  G06F16/288 ,  G06F16/24552 ,  G06F16/2343

Abstract: A method for modifying key-value pairs of a B+ tree is provided. The method receives a request to modify a particular key-value pair. Each node of the tree has a modification number. The method traverses a path on the tree from the root node toward the particular node. The traversing includes upon reaching a parent node of the path, acquiring a shared lock on both the parent node and a child node one level below the parent node. Upon determining that the child node is the particular node, the method stores the modification number of the particular node, releases the shared lock on the particular node, compares a current modification number of the node with its stored number, and acquires an exclusive lock on the node if the numbers are the same. The method increments the current modification number of the node and modifies it while in the exclusive lock.

公开(公告)号：US20220197861A1

公开(公告)日：2022-06-23

申请号：US17131155

申请日：2020-12-22

Applicant: VMware, Inc.

Inventor： Wenguang WANG ,  Hardik Singh NEGI ,  Junlong GAO ,  Vamsi GUNTURU

IPC: G06F16/11 ,  G06F16/18 ,  G06F16/22 ,  G06F16/23 ,  G06F16/2455

Abstract: System and method for managing snapshots of storage objects in a storage system use a consolidation operation to reduce read amplification for stored snapshots of a storage object that are stored in log segments in the storage system according to a log-structured file system as storage service objects. The consolidation operation involves identifying target log segments among the log segments that include live blocks that are associated with the latest snapshot of the storage object and determining the number of the live blocks included in each of the target log segments. Based on the number of the live blocks in each of the target log segments, candidate consolidation log segments are determined from the target log segments. The live blocks in the candidate consolidation log segments are then consolidated to new log segments, which are uploaded to the storage system as new storage service objects.

公开(公告)号：US20230195576A1

公开(公告)日：2023-06-22

申请号：US17644618

申请日：2021-12-16

Applicant: VMware, Inc.

Inventor： Enning XIANG ,  Pranay SINGH ,  Junlong GAO ,  Hardik Singh NEGI ,  Wenguang WANG

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

CPC classification number: G06F11/1407 ,  G06F11/1474 ,  G06F16/128 ,  G06F16/2246

Abstract: A method for resumeable snapshot deletion is provided. A method for deletion of nodes maintained in an ordered data structure for a first snapshot includes processing the nodes maintained in the ordered data structure according to a defined order, setting a node path cursor with a pointer to a node and an indication of the deletion of the node; storing the node path cursor in a persistent storage; and during processing of the nodes: detecting a failure; after the failure, checking the pointer of the node path cursor; and resuming processing of the nodes starting from the first node indicated by the pointer.

公开(公告)号：US20220261386A1

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

申请号：US17177686

申请日：2021-02-17

Applicant: VMware, Inc.

Inventor： Hardik Singh NEGI ,  Wenguang WANG ,  Eric KNAUFT

IPC: G06F16/22 ,  G06F16/23 ,  G06F16/2455 ,  G06F16/28

Abstract: A method for modifying key-value pairs of a B+ tree is provided. The method receives a request to modify a particular key-value pair. Each node of the tree has a modification number. The method traverses a path on the tree from the root node toward the particular node. The traversing includes upon reaching a parent node of the path, acquiring a shared lock on both the parent node and a child node one level below the parent node. Upon determining that the child node is the particular node, the method stores the modification number of the particular node, releases the shared lock on the particular node, compares a current modification number of the node with its stored number, and acquires an exclusive lock on the node if the numbers are the same. The method increments the current modification number of the node and modifies it while in the exclusive lock.