PERFORMING RESYNCHRONIZATION JOBS IN A DISTRIBUTED STORAGE SYSTEM BASED ON A PARALLELISM POLICY

    公开(公告)号:US20210004163A1

    公开(公告)日:2021-01-07

    申请号:US16504204

    申请日:2019-07-05

    Applicant: VMWARE, INC.

    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.

    SPACE EFFICIENCY IN LOG-STRUCTURED FILE SYSTEMS USING UNBALANCED SPLITS

    公开(公告)号:US20250094401A1

    公开(公告)日:2025-03-20

    申请号:US18469533

    申请日:2023-09-18

    Applicant: VMware, Inc.

    Abstract: A system manages a log-structured file system (LFS) by: receiving an input/output (I/O) operation for the LFS, the I/O operation prompting a key to be added to a first node of a tree metadata structure, the tree mapping addresses in a first address space to addresses in a second address space; determining that addition of the key to the first node would exceed a maximum number of keys allowed in the first node; adding a second node to the tree based on the determining, the second node containing the key; moving a quantity of keys from the first node to the second node such that a total number of keys resulting in the second node is less than half of the maximum number of keys, minus one, configured to be stored in nodes of the LFS; and writing updates to the tree metadata structure within the LFS.

    IMPLEMENTING NATIVE SNAPSHOTTING FOR REDO-LOG FORMAT SNAPSHOTS

    公开(公告)号:US20240220370A1

    公开(公告)日:2024-07-04

    申请号:US18147061

    申请日:2022-12-28

    Applicant: VMware, Inc.

    CPC classification number: G06F11/1451 G06F11/1435 G06F11/1464 G06F2201/845

    Abstract: A method for implementing native snapshot capabilities on non-native snapshots includes generating a virtual disk container having both native snapshot functionality and functionality of the non-native snapshot, including redo-log snapshot functionality. Redo-log parent disk chains may be preserved, along with subsequent native snapshot data, in virtual disk container objects. A virtual root node of a copy-on-write data structure of a virtual disk container object enables snapshotting and traversal between a redo-log disk chain and a native snapshot disk chain. Throughout backup and reversion operations, the virtual disk container object may be reparented as necessary, and a constant running point may be maintained for the virtual disk container object.

    REVERSE DELETION OF A CHAIN OF SNAPSHOTS
    36.
    发明公开

    公开(公告)号:US20230153269A1

    公开(公告)日:2023-05-18

    申请号:US17455519

    申请日:2021-11-18

    Applicant: VMware, Inc.

    CPC classification number: G06F16/128 G06F16/125 G06F16/14

    Abstract: A method for the reverse deletion of a plurality of snapshots in a chain of snapshots is provided. The method includes in reverse order, starting from a latest snapshot in time to an earliest snapshot in time of the plurality of snapshots: identifying at least one of a first set of one or more data blocks of a snapshot that are shared with an earlier snapshot in time in the chain of snapshots or a second set of one or more data blocks of the snapshot that are owned by the snapshot and processing the second set of one or more data blocks and skipping processing the first set of one or more data blocks, wherein processing the second set of one or more data blocks comprises performing one or more actions to maintain and/or delete data blocks of the second set of one or more data blocks.

    AGGREGATING BLOCK MAPPING METADATA TO IMPROVE LINKED CLONE READ PERFORMANCE

    公开(公告)号:US20230023307A1

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

    申请号:US17384298

    申请日:2021-07-23

    Applicant: VMware, Inc.

    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).

    UPGRADING THE FILE SYSTEM OF OBJECTS IN A DISTRIBUTED STORAGE SYSTEM

    公开(公告)号:US20230004525A1

    公开(公告)日:2023-01-05

    申请号:US17367233

    申请日:2021-07-02

    Applicant: VMware, Inc.

    Abstract: An example method of upgrading a distributed storage object from a first version to a second version includes: querying metadata of a first component configured according to the first version of the distributed storage object, the metadata defining extents of data on a disk group of the first component; populating, for a second component configured according to the second version of the distributed storage object, logical and middle maps based on the metadata such that initial entries in the logical map point to initial entries in the middle map, and the initial entries in the middle map point to physical addresses of the disk group of the first component; and reading the data from the disk group of the first component and writing the data to a disk group of the second component while updating the initial entries in the middle map.

    COORDINATOR OWNERSHIP AUTHENTICATION IN A DISTRIBUTED SYSTEM WITH MULTIPLE STORAGE OBJECT COORDINATORS

    公开(公告)号:US20190052708A1

    公开(公告)日:2019-02-14

    申请号:US15674375

    申请日:2017-08-10

    Applicant: VMware, Inc.

    Abstract: Exemplary methods, apparatuses, and systems include a replica node storing a component of a storage object detecting that a primary coordinator for the storage object component is no longer available to serve as primary coordinator. The replica node is within a cluster of nodes storing components of the storage object. In response to detecting that the primary coordinator is no longer available, the replica node updates a first metadata entry indicating that a secondary coordinator for the storage object component is unhealthy. The replica node rejects connection requests from the secondary coordinator in response to the first metadata entry indicating that the secondary coordinator for the storage object component is unhealthy.

Patent Agency Ranking