公开(公告)号：US12164505B2

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

申请号：US17957941

申请日：2022-09-30

Applicant: VMware LLC

Inventor： Yiqi Xu ,  Eric Knauft ,  Enning Xiang

IPC: G06F16/23 ,  G06F13/16

Abstract: System and method for managing different classes of storage input/output (I/O) requests for a two-phase commit operation in a distributed storage system assigns reserved log sequence values to each of storage I/O requests of a first class, which are added to a two-phase commit queue. The reserved log sequence values of the storage I/O requests of the first class in the two-phase commit queue are assigned to some of the storage I/O requests of the second class, which are added to the two-phase commit queue.

公开(公告)号：US12248797B2

公开(公告)日：2025-03-11

申请号：US17346607

申请日：2021-06-14

Applicant: VMware LLC

Inventor： Enning Xiang ,  Wenguang Wang

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

Abstract: Linked clone read performance when retrieving data from a clone is improved at least by aggregating block mapping metadata efficiently. Primary metadata for a child clone maps a logical block address (LBA) for data in a data region of the child clone to a physical sector address (PSA) for data in the data region of the child clone. At least a portion of primary metadata for a parent clone of the child clone is copied into archival metadata for the child clone. In response to a read request, data is returned from the child clone, parent clone, or another ancestor of the child clone based on whether or not a read request LBA is within the primary metadata for the child clone, or within the archival metadata.

公开(公告)号：US12111771B2

公开(公告)日：2024-10-08

申请号：US17384298

申请日：2021-07-23

Applicant: VMware LLC

Inventor： Enning Xiang ,  Wenguang Wang

IPC: G06F12/10

CPC classification number: G06F12/10 ,  G06F2212/657

Abstract: Linked clone read performance (e.g., retrieving data) is improved at least by minimizing the number of input/output (I/O) operations. For a child clone, a local logical extent and an inherited logical extent are generated. The local logical extent comprises a logical block address (LBA) for data in a data region of the child clone and a physical sector address (PSA) corresponding to the LBA for the data in the data region of the child clone. The inherited logical extent spans logical extents that are accessible to the child clone. The inherited logical extent comprises an LBA for data in a data region of an ancestor of the child clone and a corresponding identifier (ID) of the ancestor. Data for an LBA in a read request may be rapidly found in the child clone (local logical extent) or an ancestor (inherited logical extent).

公开(公告)号：US12271298B2

公开(公告)日：2025-04-08

申请号：US18333986

申请日：2023-06-13

Applicant: VMware LLC

Inventor： Enning Xiang ,  Wenguang Wang ,  Yifan Wang

IPC: G06F12/02

Abstract: The disclosure herein describes deduplicating data chunks using chunk objects. A batch of data chunks is obtained from an original data object and a hash value is calculated for each data chunk. A first duplicate data chunk is identified using the hash value and a hash map. A chunk logical block address (LBA) of a chunk object is assigned to the duplicate data chunk. Payload data of the duplicate data chunk is migrated from the original data object to the chunk object, and a chunk map is updated to map the chunk LBA to a physical sector address (PSA) of the migrated payload data on the chunk object. A hash entry is updated to map to the chunk object and the chunk LBA. An address map of the original data object is updated to map an LBA of the duplicate data chunk to the chunk object and the chunk LBA.

公开(公告)号：US12141440B2

公开(公告)日：2024-11-12

申请号：US18048184

申请日：2022-10-20

Applicant: VMware LLC

Inventor： Yiqi Xu ,  Enning Xiang ,  Eric Knauft ,  Pascal Renauld

IPC: G06F3/06 ,  G06F9/38 ,  G06F9/455 ,  G06F9/48 ,  G06F9/50 ,  G06F9/52

Abstract: The disclosure herein describes performing resynchronization (“resync”) jobs in a distributed storage system based on a parallelism policy. A resync job is obtained from a queue and input/output (I/O) resources that will be used during execution of the resync job are identified. Available bandwidth slots of each I/O resource of the identified I/O resources are determined. The parallelism policy is applied to the identified I/O resources and the available bandwidth slots. Based on the application of the parallelism policy, a bottleneck resource of the I/O resources is determined and a parallel I/O value is calculated based on the available bandwidth slots of the bottleneck resource, wherein the parallel I/O value indicates a quantity of I/O tasks that can be performed in parallel. The resync job is executed using the I/O resources, the execution of the resync job including performance of I/O tasks in parallel based on the parallel I/O value.

公开(公告)号：US11880584B2

公开(公告)日：2024-01-23

申请号：US17348016

申请日：2021-06-15

Applicant: VMware LLC

Inventor： Enning Xiang ,  Wenguang Wang

IPC: G06F3/06 ,  G06F9/455 ,  G06F16/22 ,  G06F16/245 ,  G06F16/188

CPC classification number: G06F3/0655 ,  G06F3/0604 ,  G06F3/0679 ,  G06F9/45558 ,  G06F16/2246 ,  G06F16/245 ,  G06F2009/45583

Abstract: A method for reverse range lookup in an ordered data structure of keys, wherein each key comprises a logical block address (LBA) and a snapshot identifier (ID) of one of one or more snapshots in a snapshot hierarchy, is provided. The keys in the ordered data structure are in an order from smallest to largest LBA, wherein in the order, keys having a same LBA are ordered from smallest to largest snapshot ID. The method includes determining a range of LBAs and traversing the ordered data structure in reverse order until a key is found that: has an LBA and a snapshot ID that is less than or equal to the last LBA and the largest snapshot ID, respectively. The method further includes adding an extent corresponding to the located key to an extent result list if the snapshot ID of the located key is not within a deny list.

公开(公告)号：US12189574B2

公开(公告)日：2025-01-07

申请号：US17504845

申请日：2021-10-19

Applicant: VMware LLC

Inventor： Enning Xiang ,  Wenguang Wang ,  Abhay Kumar Jain ,  Sriram Patil ,  Asit Desai ,  Eric Knauft

IPC: G06F16/11 ,  G06F12/02 ,  G06F16/182 ,  G06F16/22

Abstract: Example methods and systems for accessing data in a log-structured file system having a plurality of snapshots of storage objects backed by a first-level copy-on-write (COW) B+ tree data structure and a plurality of second-level B+ tree data structures have been disclosed. One example method includes obtaining a first first-level mapping associated with a first snapshot from the plurality of snapshots based on a first logical block address, wherein each of the plurality of snapshots corresponds to each of the plurality of second-level B+ tree data structures, identifying a first second-level B+ tree data structure corresponding to one of the plurality of snapshots based on the first first-level mapping, obtaining a first second-level mapping based on the first logical block address in the first second-level B+ tree data structure, obtaining a first physical block address based on the first second-level mapping, and accessing data at the first physical block address.