公开(公告)号：US20170220777A1

公开(公告)日：2017-08-03

申请号：US15013877

申请日：2016-02-02

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Luke Lu

IPC: G06F21/10 ,  G06F21/62 ,  G06F17/30

CPC classification number: G06F21/105 ,  G06F16/128 ,  G06F16/183 ,  G06F16/188 ,  G06F21/6218 ,  G06F2221/0771 ,  G06F2221/2137

Abstract: Processing in an asymmetrically distributed file system may include storing first data representative of the content of the files in a file system volume among a plurality of storage nodes. Second data representative of attributes of the files in the file system volume may be stored in only one of the storage nodes. Time-limited leases allow clients direct access to the plurality of storage node in order to access portions of the file system volume. The time-limited leases may be provided to client lessors. Snapshots of the file system volume may be generated after sending a revocation to the client lessors to revoke time-limited leases provided to the client lessors and having received the acknowledgements of the revocations or after the leases have expired for non-responding lessors, to ensure that changes are not made to the file system volume during snapshot processing.

公开(公告)号：US09612749B2

公开(公告)日：2017-04-04

申请号：US14716832

申请日：2015-05-19

Applicant: VMware, Inc.

Inventor： Wenguang Wang

IPC: G06F13/00 ,  G06F3/06 ,  G06F12/0877

CPC classification number: G06F3/0608 ,  G06F3/0641 ,  G06F3/0656 ,  G06F3/0659 ,  G06F3/067 ,  G06F12/0864 ,  G06F12/0866 ,  G06F12/0877 ,  G06F12/123 ,  G06F2212/1024 ,  G06F2212/1041 ,  G06F2212/222 ,  G06F2212/254 ,  G06F2212/461 ,  G06F2212/465 ,  G06F2212/466

Abstract: Examples perform asynchronous deduplication of storage, such as virtualized or physical disks. Incoming input/output (I/O) commands containing data are subdivided into blocks which are written both to storage and to an in-memory cache. As idle processing resources become available, deduplication is performed on the storage using the in-memory cache. In this manner, read operations from storage are avoided in favor of the read operations from the in-memory cache.

公开(公告)号：US20170083411A1

公开(公告)日：2017-03-23

申请号：US14857845

申请日：2015-09-18

Applicant: VMWARE, INC.

Inventor： RADU BERINDE ,  Wenguang Wang

IPC: G06F11/14 ,  G06F3/06

CPC classification number: G06F11/1469 ,  G06F3/0619 ,  G06F3/0629 ,  G06F3/0673 ,  G06F11/1402 ,  G06F11/1415 ,  G06F11/1471 ,  G06F2201/81 ,  G06F2201/84

Abstract: Techniques for efficiently storing the state of an in-memory table to persistent storage are described. In one embodiment, one or more requests to update an entry in an in-memory table with one or more values are received, wherein the in-memory table is stored in non-persistent memory. The one or more entries in the in-memory table are then updated with the one or more values and one or more recent redo log entries that correspond to the one or more entries and one or more values are generated. One or more historical entries in the table are selected and one or more historical redo log entries that correspond to the one or more historical entries are generated. The recent redo log entry and the one or more historical redo log entries are saved to a bounded redo log, wherein the bounded redo log is stored in persistent storage.

公开(公告)号：US12045204B2

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

申请号：US16552976

申请日：2019-08-27

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Junlong Gao ,  Marcos K. Aguilera ,  Richard P. Spillane ,  Christos Karamanolis ,  Maxime Austruy

IPC: G06F15/16 ,  G06F16/13 ,  G06F16/172 ,  G06F16/174 ,  G06F9/455

CPC classification number: G06F16/1752 ,  G06F16/137 ,  G06F16/172 ,  G06F9/45558 ,  G06F2009/45583

Abstract: The present disclosure provides techniques for deduplicating files. The techniques include creating a cache or subset of a large data structure. The large data structure organizes information by random hash values. The random hash values result in a random organization of information within the data structure, with the information spanning a large number of storage blocks within a storage system. The cache, however, is within memory and is small relative to the data structure. The cache is created so as to contain information that is likely to be needed during deduplication of a file. Having needed information within memory rather than in storage results in faster read and write operations to that information, improving the performance of a computing system.

公开(公告)号：US11625370B2

公开(公告)日：2023-04-11

申请号：US16842657

申请日：2020-04-07

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Vamsi Gunturu ,  Eric Knauft

IPC: G06F16/215 ,  H04L67/1097 ,  G06F12/0804 ,  G06F16/23

Abstract: Techniques for reducing data log recovery time and metadata write amplification when checkpointing a data log of a storage object in a distributed storage system are provided. In one set of embodiments, a node of the system can determine whether the data log has reached a first threshold size, where the data log comprises a plurality of data log records, and where each data log record includes data and metadata for a write request directed to the storage object. If the data log has reached the first threshold size, the node can copy, from each of the plurality of data log records, the metadata for the write request to a corresponding metadata log entry in a metadata log of the storage object. The node can then truncate the data log by removing the plurality of data log records.

公开(公告)号：US20230083104A1

公开(公告)日：2023-03-16

申请号：US17471568

申请日：2021-09-10

Applicant: VMware, Inc.

Inventor： Enning Xiang ,  Pranay Singh ,  Wenguang Wang

IPC: G06F16/11 ,  G06F3/06

Abstract: At the time of deleting a snapshot, a storage system can allocate a buffer in volatile memory, scan a plurality of logical block address (LBA)-to-virtual block address (VBA) mappings included in a first tree metadata structure of the snapshot, and, for each scanned LBA-to-VBA mapping, identify in a second tree metadata structure a VBA-to-physical block address (PBA) mapping referenced by the LBA-to-VBA mapping. If the VBA-to-PBA mapping is exclusively owned by the snapshot, the storage system can add a record to the buffer that includes the VBA specified in the VBA-to-PBA mapping. The storage system can subsequently sort the records added to the buffer in VBA order and sequentially process the sorted records to remove their corresponding VBA-to-PBA mappings from the second tree metadata structure.

公开(公告)号：US11573860B1

公开(公告)日：2023-02-07

申请号：US17456152

申请日：2021-11-22

Applicant: VMware, Inc.

Inventor： Enning Xiang ,  Wenguang Wang ,  Mrityunjay Kumar

IPC: G06F3/06 ,  G06F11/14

Abstract: A method for verifying a consistency of snapshot metadata maintained in an ordered data structure for a plurality of snapshots in a snapshot hierarchy is provided. The method includes identifying a first plurality of nodes maintained in a first ordered data structure for a first snapshot that is a child of a second snapshot; for a first node of the first plurality of nodes, verifying the first node by checking for the first node in a second node map maintained in memory for the second snapshot, wherein the second node map includes a plurality of verified nodes in a second ordered data structure; and based on whether the first node is in the second node map: adding the first node to a first node map maintained in memory for the first snapshot, wherein the first node map includes verified nodes of the first plurality of nodes; or triggering an alarm.

公开(公告)号：US20220405305A1

公开(公告)日：2022-12-22

申请号：US17355125

申请日：2021-06-22

Applicant: VMware, Inc.

Inventor： Enning Xiang ,  Wenguang Wang ,  Pranay Singh ,  Subhradyuti Sarkar ,  Nitin Rastogi

IPC: G06F16/27 ,  G06F16/22

Abstract: System and method for managing copy-on-write (COW) B tree structures for metadata of storage objects stored in a storage system determine, when a request to modify a target storage object stored in the storage system that requires a modification of a target leaf node in a B tree structure for metadata of the target storage object is received, whether an operation sequence number of the target leaf node is greater than a snapshot sequence number of a parent snapshot of a running point of the B tree structure. When the operation sequence number is greater than the snapshot sequence number, the target leaf mode is modified in place without copying the target leaf node. When the operation sequence number is not greater than the snapshot sequence number, the target leaf node is copied as a new leaf node for the B tree structure and the new leaf node is modified.

公开(公告)号：US11507544B2

公开(公告)日：2022-11-22

申请号：US16894663

申请日：2020-06-05

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Vamsidhar Gunturu ,  Eric Knauft ,  Pascal Renauld

IPC: G06F7/00 ,  G06F16/18 ,  G06F16/182 ,  G06F16/17 ,  G06F16/22 ,  G06F12/02 ,  G06F12/0817 ,  G06F16/2457

Abstract: Techniques for efficiently storing client data blocks on a distributed-computing system are provided. The system includes a fast performance tier and a large capacity tier. The capacity tier stores the client data blocks in erasure encoded data stripes. The performance tier stores logical map data including an address map indicating a correspondence between logical addresses associated with a first layer of the system and physical addresses associated with a second layer. A method includes receiving a request to include additional client data blocks in the client blocks. The request indicates logical addresses for additional blocks. Corresponding physical addresses for additional block are determined. Each additional block is stored at the physical address. Additional logical map data is stored in the performance tier. Storing the additional logical map data includes updating the address map to indicate the correspondence between the logical addresses and the physical addresses for the additional blocks.

公开(公告)号：US11494276B2

公开(公告)日：2022-11-08

申请号：US16925168

申请日：2020-07-09

Applicant: VMware, Inc.

Inventor： Wenguang Wang ,  Vamsi Gunturu ,  Eric Knauft

IPC: G06F11/00 ,  G06F11/14 ,  G06F16/23

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.