File service auto-remediation in storage systems

    公开(公告)号:US11321197B2

    公开(公告)日:2022-05-03

    申请号:US16859944

    申请日:2020-04-27

    Applicant: VMware, Inc.

    Abstract: System and method for automatic remediation for a distributed file system uses a file system (FS) remediation module running in a cluster management server and FS remediation agents running in a cluster of host computers. The FS remediation module monitors the cluster of host computers for related events. When a first file system service (FSS)-impacting event is detected, a cluster-level remediation action is executed at the cluster management server by the FS remediation module in response to the detected first FSS-impacting event. When a second FSS-impacting event is detected, a host-level remediation action is executed at one or more of the host computers in the cluster by the FS remediation agents in response to the detected second FSS-impacting event.

    Reduced write amplification for large-block data log

    公开(公告)号:US11307932B2

    公开(公告)日:2022-04-19

    申请号:US16925145

    申请日:2020-07-09

    Applicant: VMware, Inc.

    Abstract: Writing to a storage system with data striping includes storing blocks of data in local memory until one or more full-stripe write operations can be performed, thus reducing write amplification on the data striped storage system. Crash recovery information includes storing the data associated metadata to respective persistent storage devices. Metadata associated with data from several clients is combined into fixed-size data blocks and stored on the respective persistent storage device.

    Tiering data to a cold storage tier of cloud object storage

    公开(公告)号:US11288129B2

    公开(公告)日:2022-03-29

    申请号:US17002577

    申请日:2020-08-25

    Applicant: VMware, Inc.

    Abstract: Techniques for tiering data to a cold storage tier of a cloud object storage platform are provided. In one set of embodiments, a computer system can identify one or more old snapshots of a data set that reside in a first storage tier of the cloud object storage platform, where the one or more old snapshots are snapshots that are unlikely to be deleted from the cloud object storage platform within a period of N days. The computer system can further, for each snapshot in the one or more old snapshots: identify one or more data blocks in the snapshot that are superseded by a more recent snapshot in the one or more old snapshots; write the one or more data blocks to a second (i.e., cold) storage tier of the cloud object storage platform that has a lower storage cost than the first storage tier; and cause the one or more data blocks to be deleted from the first storage tier.

    SUPPORTING DEDUPLICATION IN FILE STORAGE USING FILE CHUNK HASHES

    公开(公告)号:US20220092033A1

    公开(公告)日:2022-03-24

    申请号:US17028405

    申请日:2020-09-22

    Applicant: VMware, Inc.

    Abstract: The present disclosure is related to methods, systems, and machine-readable media for supporting deduplication in file storage using file chunk hashes. A hash of a chunk of a log segment can be received from a software defined data center. A chunk identifier can be associated with the hash in a hash map that stores associations between sequentially-allocated chunk identifiers and hashes. The chunk identifier can be associated with a logical address corresponding to the chunk of the log segment in a logical map that stores associations between the sequentially-allocated chunk identifiers and logical addresses. A search of the hash map can be performed to determine if the chunk is a duplicate, and the chunk can be deduplicated responsive to a determination that the chunk is a duplicate.

    CLONELESS SNAPSHOT REVERSION
    65.
    发明申请

    公开(公告)号:US20220027185A1

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

    申请号:US16936846

    申请日:2020-07-23

    Applicant: VMware, Inc.

    Abstract: The present disclosure is related to methods, systems, and machine-readable media for cloneless snapshot reversion. A request can be received to revert to a past snapshot of a virtual computing instance in a snapshot chain of a snapshot tree provided by a software defined data center. A live snapshot can be created at an end of the snapshot chain comprising the past snapshot. An intervening snapshot in the snapshot chain can be indicated as abandoned in a snapshot map associated with the snapshot tree based on the reversion.

    REDUCED WRITE AMPLIFICATION FOR LARGE-BLOCK DATA LOG

    公开(公告)号:US20220012131A1

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

    申请号:US16925145

    申请日:2020-07-09

    Applicant: VMware, Inc.

    Abstract: Writing to a storage system with data striping includes storing blocks of data in local memory until one or more full-stripe write operations can be performed, thus reducing write amplification on the data striped storage system. Crash recovery information includes storing the data associated metadata to respective persistent storage devices. Metadata associated with data from several clients is combined into fixed-size data blocks and stored on the respective persistent storage device

    Using Segment Pre-Allocation to Support Large Segments

    公开(公告)号:US20210311652A1

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

    申请号:US16842635

    申请日:2020-04-07

    Applicant: VMware, Inc.

    Abstract: Techniques for supporting large segments when issuing writes to an erasure coded storage object in a distributed storage system are provided. In one set of embodiments, a node of the system can pre-allocate a segment of space in a capacity object of the storage object, receive a write request for updating a logical data block of the storage object, write data/metadata for the block to a record in a data log of a metadata object of the storage object, place the block in an in-memory bank, and determine whether the in-memory bank has become full. If so, the node can compute/fill-in one or more parity blocks for each stripe of the storage object in the in-memory bank and write, based on a next sub-segment pointer pointing to a free sub-segment of the pre-allocated segment, the contents of the in-memory bank via a full stripe write to the free sub-segment.

    Issuing Efficient Writes to Erasure Coded Objects in a Distributed Storage System via Adaptive Logging

    公开(公告)号:US20210311631A1

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

    申请号:US17089605

    申请日:2020-11-04

    Applicant: VMware, Inc.

    Abstract: Techniques for issuing efficient writes to an erasure coded storage object in a distributed storage system via adaptive logging are provided. In one set of embodiments, a node of the system can receive a write request for updating one or more logical data blocks of the storage object and determine whether a size of the one or more logical data blocks meets or exceeds a threshold size. Upon determining that the size of the one or more logical data blocks meets or exceeds the threshold size, the node can allocate a segment in a capacity object of the storage object, write the one or more logical data blocks via a full stripe write to the segment, and write metadata for the one or more logical data blocks to a log record in a log of a metadata object of the storage object. The metadata written to the log record can include mappings between logical block addresses (LBAs) of the one or more logical data blocks and physical block addresses (PBAs) where the one or more logical data blocks reside in the segment.

    System and method of a highly concurrent cache replacement algorithm

    公开(公告)号:US11086779B2

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

    申请号:US16679570

    申请日:2019-11-11

    Applicant: VMware, Inc.

    Abstract: Disclosed are a method and system for managing multi-threaded concurrent access to a cache data structure. The cache data structure includes a hash table and three queues. The hash table includes a list of elements for each hash bucket with each hash bucket containing a mutex object and elements in each of the queues containing lock objects. Multiple threads can each lock a different hash bucket to have access to the list, and multiple threads can each lock a different element in the queues. The locks permit highly concurrent access to the cache data structure without conflict. Also, atomic operations are used to obtain pointers to elements in the queues so that a thread can safely advance each pointer. Race conditions that are encountered with locking an element in the queues or entering an element into the hash table are detected, and the operation encountering the race condition is retried.

Patent Agency Ranking