SYSTEM AND METHOD OF RESYNCING DATA IN ERASURE-CODED OBJECTS ON DISTRIBUTED STORAGE SYSTEMS WITHOUT REQUIRING CHECKSUM IN THE UNDERLYING STORAGE

    公开(公告)号:US20210349790A1

    公开(公告)日:2021-11-11

    申请号:US16870801

    申请日:2020-05-08

    Applicant: VMware, Inc.

    Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for resynchronizing data in a storage system. One of the methods includes determining that a particular primary disk of a capacity object of a storage system has failed, wherein the capacity comprises a plurality of segments, and wherein the each segment comprises: a plurality of primary columns each corresponding to a respective primary disk of the capacity object, and a plurality of parity columns each corresponding to a respective parity disk of the capacity object; and resynchronizing, for each segment of one or more segments of the capacity object, the primary column of the segment corresponding to the particular primary disk using i) the primary columns of the segment corresponding to each other primary disk of the capacity object, ii) one or more parity columns of the segment, and iii) the column summaries of the segment.

    WORKLOAD ESTIMATION OF DATA RESYNCHRONIZATION

    公开(公告)号:US20190324807A1

    公开(公告)日:2019-10-24

    申请号:US15955900

    申请日:2018-04-18

    Applicant: VMware, Inc.

    Abstract: Embodiments include estimating a workload of a resynchronization task for a data component in a logical storage system. Embodiments include detecting a connection from the data component, wherein the data component was previously disconnected. Embodiments further include determining a layout of the data storage system. Embodiments further include estimating the workload of the resynchronization task based on the layout. If the layout indicates that the data component has an active mirror component, embodiments include estimating the workload to be a used capacity of the active mirror component. If the layout indicates that the data component does not have an active mirror component and that the data component has a stale mirror component, embodiments include estimating the workload to be a sum of a used capacity of the stale mirror component and an estimated size of missed input/output operations. One or more actions may be performed based on the estimate.

    REDUCING DATA AMPLIFICATION WHEN REPLICATING OBJECTS ACROSS DIFFERENT SITES

    公开(公告)号:US20190034087A1

    公开(公告)日:2019-01-31

    申请号:US15660682

    申请日:2017-07-26

    Applicant: VMware, Inc.

    Abstract: Component objects of a virtual disk are backed by first storage nodes, which are at a primary site, and replicated in second storage nodes, which are at a secondary site. Responsive to a write command issued to the virtual disk, a coordinating node at the primary site issues a first write operation to a first replication module running therein, and transmits a second write operation to a second replication module running in a coordinating node at the secondary site. The first replication module, responsive to the first write operation, instructs the first storage nodes backing first and second component objects of the virtual disk to write the data. The second replication module, responsive to the second write operation, instructs the second storage nodes backing third and fourth component objects, which are replicas of the first and second component objects, respectively, to write the data.

    CHUNKING AND DEDUPLICATION OF DATA USING ERROR CHECKING VALUES

    公开(公告)号:US20240419350A1

    公开(公告)日:2024-12-19

    申请号:US18334231

    申请日:2023-06-13

    Applicant: VMware, Inc.

    Abstract: Chunks of data are identified and deduplication is performed on the chunks of data using associated cyclic redundancy check (CRC) values. A plurality of CRC values is obtained that is associated with consecutive data blocks stored in a payload data store. Cut point CRC values are identified in the plurality of CRC values and CRC chunks are identified based on those cut point CRC values, wherein each CRC chunk is bounded by two consecutive cut point CRC values. A CRC chunk hash value is generated for each CRC chunk. A pair of duplicate CRC chunks is identified using the CRC chunk hash values and a deduplication operation is performed in association with the identified pair of duplicate CRC chunks. Using existing CRC values during the identification of chunk cut points reduces the computing resource costs associated with performing that process using the data blocks.

    MICRO-BATCHING METADATA UPDATES TO REDUCE TRANSACTION JOURNAL OVERHEAD DURING SNAPSHOT DELETION

    公开(公告)号:US20230214146A1

    公开(公告)日:2023-07-06

    申请号:US17646993

    申请日:2022-01-04

    Applicant: VMware, Inc.

    CPC classification number: G06F3/0652 G06F3/064 G06F3/0604 G06F3/0679

    Abstract: A method for deleting one or more snapshots using micro-batch processing is provided. The method includes receiving a request to delete the one or more snapshots, identifying one or more middle map extents exclusively owned by the one or more snapshots requested to be deleted, wherein metadata for the one or more snapshots is stored in one or more logical maps having logical map extents mapping logical block addresses (LBAs) to middle block addresses (MBAs) and a middle map having middle map extents mapping MBAs to physical block addresses (PBAs) of physical locations where data blocks are written, adding MBAs of the identified one or more middle map extents in a batch, determining a first micro-batch including a first subset of the MBAs in the batch, the first subset of MBAs being MBAs less than a first upper bound MBA, and using a first transaction to delete the middle map extents corresponding to the first subset of MBAs included in the first micro-batch.

    TWO-LEVEL LOGICAL TO PHYSICAL MAPPING MECHANISM IN A LOG-STRUCTURED FILE SYSTEM

    公开(公告)号:US20230123478A1

    公开(公告)日:2023-04-20

    申请号:US17504845

    申请日:2021-10-19

    Applicant: VMware, Inc.

    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.

    RESOURCE EFFICIENT COMPONENT PLACEMENT IN A DISTRIBUTED STORAGE SYSTEM

    公开(公告)号:US20230059248A1

    公开(公告)日:2023-02-23

    申请号:US17404839

    申请日:2021-08-17

    Applicant: VMware, Inc.

    Abstract: An example method of placing a durability component in a redundant array of independent/inexpensive disks (RAID) tree of an object stored in a virtual storage area network (vSAN) of a virtualized computing system is described. The method includes identifying a base component in the RAID tree that is unavailable due to a failure in the virtualized computing system; searching the RAID tree, from a level of the base component towards a root of the RAID tree, for a selected level to place a durability component that protects at least the base component, the selected level satisfying at least one of a plurality of constraints; and provisioning the durability component at the selected level of the RAID tree, the selected level being above the level of the base component in the RAID tree.

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

    公开(公告)号:US20230055813A1

    公开(公告)日:2023-02-23

    申请号:US18048184

    申请日:2022-10-20

    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.

    HYBRID SYNCHRONIZATION USING A SHADOW COMPONENT

    公开(公告)号:US20220171739A1

    公开(公告)日:2022-06-02

    申请号:US17106037

    申请日:2020-11-27

    Applicant: VMWARE, INC.

    Abstract: Hybrid synchronization using a shadow component includes detecting a first component of a plurality of mirrored components of a distributed data object becoming unavailable. The mirrored components include a delta component (a special shadow component) and a regular mirror (shadow) component. The delta component indicates a shorter history of changes to data blocks of a log-structured file system (LFS) than is indicated by the regular mirror component. During the unavailability of the first component, at least one write I/O is committed by the delta component. The commit is tracked by the delta component in a first tracking bitmap associated with the delta component. Based at least on detecting the first component becoming available, the first component is synchronized with data from the delta component, based at least on changed data blocks indicated in the first tracking bitmap.

Patent Agency Ranking