Efficient handling of RAID-F component repair failures

    公开(公告)号:US11256583B2

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

    申请号:US16410549

    申请日:2019-05-13

    Applicant: VMware, Inc.

    Abstract: In one set of embodiments, a storage system can execute a repair process for a first component of a file or object stored on the storage system, where the repair process is initiated in response to the first component becoming inaccessible by the storage system, and where the file or object is split across a plurality of components including the first component. The executing can include, for each chunk in an address space of the first component starting from an initial chunk pointed to by a cursor: (1) determining whether the chunk is mapped to the first component, (2) if the chunk is mapped to the first component, copying data for the chunk from a mirror copy of the first component to a second component in the plurality of components, and (3) updating the cursor to point to a next chunk in the address space.

    REDUCED WRITE AMPLIFICATION USING SMALL-BLOCK LOG

    公开(公告)号:US20220012132A1

    公开(公告)日:2022-01-13

    申请号:US16925168

    申请日:2020-07-09

    Applicant: VMware, Inc.

    Abstract: Processing write requests from clients includes logging the associated data into logs corresponding to the data objects targeted by the write requests. The logs are persisted by combining log entries from each of the logs into one ore more fixed-size data blocks. The fixed-size data blocks are inserted into a data tree stored on a block-based storage device.

    EFFICIENT ACCESSING METHODS FOR BYPASSING SECOND LAYER MAPPING OF DATA BLOCKS IN FILE SYSTEMS OF DISTRIBUTED DATA SYSTEMS

    公开(公告)号:US20210382825A1

    公开(公告)日:2021-12-09

    申请号:US16914149

    申请日:2020-06-26

    Applicant: VMware, Inc.

    Abstract: Systems for accessing client data is described. A request to access a first data block is received. The request indicates a first logical address referencing the first data block. First mapping data is employed to identify a first physical addresses corresponding to the first logical addresses. The first mapping data encodes a first LOM transaction ID and candidate local addresses. The first mapping data is employed to identify the candidate local address and the first LOM transaction ID. A usage table is employed to determine the current status of the first LOM transaction ID. The candidate local address is employed to access the first data block. Second mapping data is employed to identify an updated local address of the set of local addresses. The updated local address currently references the first data block. The updated local address is employed to access the first data block.

    Storing B-tree pages in capacity tier for erasure-coded storage in distributed data systems

    公开(公告)号:US11144394B1

    公开(公告)日:2021-10-12

    申请号:US16894646

    申请日:2020-06-05

    Applicant: VMware, Inc.

    Abstract: Systems, for managing metadata data blocks, include a fast performance tier and a large capacity tier. The capacity tier stores the data blocks in erasure-encoded stripes. The performance tier stores map data indicating correspondences between logical addresses, associated with a first layer of the system, and physical addresses associated with a second layer. The map data is structured as a B-tree with leaf nodes and index nodes. A method includes determining a volume associated with the leaves. In response to the volume being greater than a threshold, migrating a portion of the leaves to the stripes of the capacity tier. A portion of the indexes that include pointers to the migrated portion of the leaves are updated to include updated pointers to physical addresses of the stripes that store the migrated leaves. A portion of the performance tier that stores the migrated leaves is re-allocated to store additional map data.

    Workload estimation of data resynchronization

    公开(公告)号:US10942782B2

    公开(公告)日:2021-03-09

    申请号:US16584244

    申请日:2019-09-26

    Applicant: VMware, Inc.

    Abstract: Embodiments include estimating a workload of a re-synchronization 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 logical storage system. Embodiments further include estimating the workload of the re-synchronization task based on the layout. One or more actions may be performed based on the estimate.

    DISTRIBUTED STORAGE SYSTEM AND METHOD FOR MANAGING STORAGE ACCESS BANDWIDTH FOR MULTIPLE CLIENTS

    公开(公告)号:US20190303308A1

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

    申请号:US15944743

    申请日:2018-04-03

    Applicant: VMware, Inc.

    Abstract: System and method for managing storage requests issued from multiple sources in a distributed storage system utilizes different queues at a host computer in the distributed storage system to place different classes of storage requests for access to a virtual storage area network. The storage requests in the queues are processed using a fair scheduling algorithm. For each queue, when the storage requests in the queue exceeds a threshold, a backpressure signal is generated and transmitted to at least one source for a class of storage requests queued in one of the queues corresponding to that backpressure signal to delay issuance of new storage requests of that class of storage requests.

    RESUMABLE REPLICA RESYNCHRONIZATION
    39.
    发明申请

    公开(公告)号:US20190303013A1

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

    申请号:US16445649

    申请日:2019-06-19

    Applicant: VMware, Inc.

    Abstract: Systems and techniques are described for transferring data. A described technique includes determining that a first replica of an object stored at a first host has become available to a distributed storage system after previously being unavailable to the distributed storage system. The object includes a range of memory addresses at which data of the object is stored. In response to determining that the first replica has become available, resyncing data for the first replica is obtained. The resyncing data indicates whether each range of memory addresses is synchronized at the first replica with other replicas of the object. Tracking data for the first replica is obtained. The tracking data indicates whether data stored at the range of memory addresses of the object has been modified at a second replica while the first replica was unavailable. The resyncing data is updated based on the tracking data.

    DISTRIBUTED TRANSACTION LOG
    40.
    发明申请

    公开(公告)号:US20180067826A1

    公开(公告)日:2018-03-08

    申请号:US15810650

    申请日:2017-11-13

    Applicant: VMware, Inc.

    Abstract: Embodiments of the disclosure provide techniques for updating a distributed transaction log on a previously offline resource object component using distributed transaction logs from active host computer nodes from separate RAID mirror configurations. Each component object maintains a journal (log) where distributed transactions are recorded. If a component object goes offline and subsequently returns (e.g., if the node hosting the component object reboots), the component object is marked as stale. To return the component object to an active state, a distributed resources module retrieves the journals from other resource component objects from other RAID configurations where the data is mirrored. The module filters corresponding data that is missing in the journal of the previously offline corresponding object and merges the filtered data to the journal.

Patent Agency Ranking