公开(公告)号：US11537297B1

公开(公告)日：2022-12-27

申请号：US17479594

申请日：2021-09-20

Applicant: VMware, Inc.

Inventor： Enning Xiang ,  Wenguang Wang ,  Pranay Singh ,  Subhradyuti Sarkar

IPC: G06F3/06

Abstract: The present disclosure is related to methods, systems, and machine-readable media for deleting snapshot pages using sequence numbers and page lookups. A monotonically-increasing sequence number (SN) can be assigned to each created page of a first snapshot of a storage volume. A first snapshot sequence number (snapSN) can be assigned to the first snapshot responsive to a creation of a second snapshot, wherein the first snapSN is equal to a largest SN of the first snapshot. An SN can be assigned to each created page of the second snapshot, wherein a first page of the second snapshot is assigned an SN monotonically increased from the first snapSN. A second snapSN can be assigned to the second snapshot responsive to a creation of a third snapshot, wherein the second snapSN is equal to a largest SN of the second snapshot. An SN can be assigned to each created page of the third snapshot, wherein a first page of the third snapshot is assigned an SN monotonically increased from the second snapSN. A deletion process can be performed in response to receiving a request to delete the second snapshot that includes deleting a particular page of the second snapshot responsive to determining that the particular page is not shared between the second snapshot and the first snapshot or between the second snapshot and the third snapshot.

公开(公告)号：US20220405305A1

公开(公告)日：2022-12-22

申请号：US17355125

申请日：2021-06-22

Applicant: VMware, Inc.

Inventor： Enning Xiang ,  Wenguang Wang ,  Pranay Singh ,  Subhradyuti Sarkar ,  Nitin Rastogi

IPC: G06F16/27 ,  G06F16/22

Abstract: System and method for managing copy-on-write (COW) B tree structures for metadata of storage objects stored in a storage system determine, when a request to modify a target storage object stored in the storage system that requires a modification of a target leaf node in a B tree structure for metadata of the target storage object is received, whether an operation sequence number of the target leaf node is greater than a snapshot sequence number of a parent snapshot of a running point of the B tree structure. When the operation sequence number is greater than the snapshot sequence number, the target leaf mode is modified in place without copying the target leaf node. When the operation sequence number is not greater than the snapshot sequence number, the target leaf node is copied as a new leaf node for the B tree structure and the new leaf node is modified.

公开(公告)号：US11822804B2

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

申请号：US17492950

申请日：2021-10-04

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Enning Xiang ,  Pranay Singh ,  Subhradyuti Sarkar

IPC: G06F12/00 ,  G06F3/06 ,  G06F12/02

CPC classification number: G06F3/0644 ,  G06F3/0619 ,  G06F3/0659 ,  G06F3/0673 ,  G06F12/0246 ,  G06F2212/7201

Abstract: The present disclosure is related to methods, systems, and machine-readable media for managing extent sharing between snapshots using mapping addresses. A first mapping address can be assigned to a first extent responsive to a request to write the first extent. A second mapping address can be assigned to a second extent responsive to a request to write the second extent. A snapshot can be created. A snapshot mapping address, that is monotonically increased from the second mapping address, can be assigned to the snapshot. A third mapping address, that is monotonically increased from the second mapping address, can be assigned to a third extent of the snapshot responsive to a request to write the third extent. An ownership status of each of the first extent, the second extent, and the third extent can be determined based respectively on: a comparison between the first mapping address and the snapshot mapping address, a comparison between the second mapping address and the snapshot mapping address, and a comparison between the third mapping address and the snapshot mapping address.

公开(公告)号：US11593399B2

公开(公告)日：2023-02-28

申请号：US17355125

申请日：2021-06-22

Applicant: VMware, Inc.

Inventor： Enning Xiang ,  Wenguang Wang ,  Pranay Singh ,  Subhradyuti Sarkar ,  Nitin Rastogi

IPC: G06F16/27 ,  G06F16/22 ,  G06F16/11

Abstract: System and method for managing copy-on-write (COW) B tree structures for metadata of storage objects stored in a storage system determine, when a request to modify a target storage object stored in the storage system that requires a modification of a target leaf node in a B tree structure for metadata of the target storage object is received, whether an operation sequence number of the target leaf node is greater than a snapshot sequence number of a parent snapshot of a running point of the B tree structure. When the operation sequence number is greater than the snapshot sequence number, the target leaf mode is modified in place without copying the target leaf node. When the operation sequence number is not greater than the snapshot sequence number, the target leaf node is copied as a new leaf node for the B tree structure and the new leaf node is modified.

公开(公告)号：US20230028678A1

公开(公告)日：2023-01-26

申请号：US17383087

申请日：2021-07-22

Applicant: VMware, Inc.

Inventor： Nitin Rastogi ,  Wenguang Wang ,  Pranay Singh ,  Subhradyuti Sarkar ,  Enning Xiang

IPC: G06F16/11 ,  G06F16/16 ,  G06F16/188 ,  G06F16/13 ,  G06F16/901

Abstract: The present disclosure is related to methods, systems, and machine-readable media for determining shared nodes between snapshots using probabilistic data structures. A unique identifier can be assigned to each node of a first tree data structure corresponding to a first snapshot of a virtual computing instance (VCI). A first probabilistic data structure representing the first tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the first tree data structure. A unique identifier can be assigned to each node of a second tree data structure corresponding to a second snapshot of the VCI. A second probabilistic data structure representing the second tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the second tree data structure. A particular node of the second tree data structure can be determined to be shared by the first tree data structure responsive to a determination that the first probabilistic data structure includes a hash of an identifier assigned to the particular node.