中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

27 records (took 0.015 seconds)

    Synchronizing changes to stale components of a distributed object using synchronization bitmaps
    1.
    发明授权
    Synchronizing changes to stale components of a distributed object using synchronization bitmaps 有权

    公开(公告)号：US11599554B2

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

    申请号：US16888527

    申请日：2020-05-29

    Applicant: VMware, Inc.

    Inventor： Enning Xiang ,  Pascal Renauld ,  Sandeep Rangaswamy ,  Xin Li ,  Yiqi Xu ,  Venkata Ramanan

    IPC: G06F16/27 ,  G06F11/14

    Abstract: The disclosure herein describes tracking changes to a stale component using a synchronization bitmap. A first component of a plurality of mirrored components of the distributed data object becomes available from an unavailable state, and a stale log sequence number (LSN) and a last committed LSN are identified. A synchronization bitmap of the first component associated with a range of LSNs (e.g., from the stale LSN to the last committed LSN) is created and configured to track changes to data blocks of the first component. A second component is identified based on the second component including a tracking bitmap associated with an LSN that matches the stale LSN of the first component. The first component is synchronized with data from the second component based on, wherein the synchronizing includes updating the synchronization bitmap to track changes made to data blocks of the first component.

    Large range lookups for Bϵ-tree
    2.
    发明授权
    Large range lookups for Bϵ-tree 有权

    公开(公告)号：US11093471B2

    公开(公告)日：2021-08-17

    申请号：US16000142

    申请日：2018-06-05

    Applicant: VMware, Inc.

    Inventor： Abhishek Gupta ,  Richard P. Spillane ,  Robert T. Johnson ,  Wenguang Wang ,  Kapil Chowksey ,  Jorge Guerra Delgado ,  Sandeep Rangaswamy ,  Srinath Premachandran

    IPC: G06F17/00 ,  G06F16/22 ,  G06F7/16

    Abstract: Embodiments herein are directed towards systems and methods for performing range lookups in Bε-trees. One example method involves receiving a request to return key-value pairs within a range of keys from the Bε-tree. The Bε-tree includes a plurality of nodes, each node being associated with a buffer that stores key-value pairs. The method further involves determining a fractional size of the range of keys. The method further involves, for each level of the Bε-tree, obtaining from within one or more buffers of one or more nodes of the level, a set of key-value pairs within the range of keys up to a size equal to the fractional size and transferring the set of key-value pairs to a result data structure. The method further involves sorting and merging all key-value pairs in the result data structure and returning the result data structure in response to the request.

    Deduplication-aware load balancing in distributed storage systems
    5.
    发明授权
    Deduplication-aware load balancing in distributed storage systems 有权

    公开(公告)号：US11461027B2

    公开(公告)日：2022-10-04

    申请号：US15653249

    申请日：2017-07-18

    Applicant: VMware, Inc.

    Inventor： Abhishek Gupta ,  Jorge Guerra Delgado ,  Sandeep Rangaswamy ,  Srinath Premachandran ,  Pascal Renauld

    IPC: G06F16/21 ,  G06F3/06 ,  G06F16/215

    Abstract: Techniques for enabling deduplication-aware load balancing in a distributed storage system are provided. In one set of embodiments, a node of the distributed storage system can receive an I/O (Input/Output) request pertaining to a data block of a storage object stored on a local storage component of the node. The node can further determine whether the I/O request requires insertion of a new entry into a deduplication hash table associated with the local storage component or deletion of an existing entry from the deduplication hash table. If the I/O request requires insertion of a new hash table entry, the node can add an identifier of the data block into a probabilistic data structure associated with the local storage component, where the probabilistic data structure is configured to maintain information regarding distinct data blocks that are likely present in the local storage component. Alternatively, if the I/O request requires deletion of an existing hash table entry, the node can remove the identifier of the data block from the probabilistic data structure.

    Optimal snapshot deletion
    6.
    发明授权
    Optimal snapshot deletion 有权

    公开(公告)号：US11010334B2

    公开(公告)日：2021-05-18

    申请号：US15947072

    申请日：2018-04-06

    Applicant: VMware, Inc.

    Inventor： Jorge Guerra Delgado ,  Richard P. Spillane ,  Kapil Chowksey ,  Sandeep Rangaswamy ,  Abhishek Gupta ,  Srinath Premachandran

    IPC: G06F16/11 ,  G06F9/455 ,  G06F16/188 ,  G06F16/22 ,  G06F16/23

    Abstract: Embodiments described herein involve improved management of snapshots of a file system. Embodiments include copying a first root node of a first snapshot to a second snapshot, the second snapshot referencing other nodes of the first snapshot. Embodiments further include incrementing reference counts of the other nodes of the first snapshot. Embodiments further include adding a storage address of the first root node to a list. Embodiments further include, each time that a copy on write operation is performed for a node of the other nodes, adding a storage address of the node to the list and decrementing the reference count of the node. Embodiments further include iterating through the list and, for each storage address in the list, decrementing the reference count of the node corresponding to the storage address and, if the reference count of the node reaches zero, freeing storage space at the storage address.

Patent Agency Ranking