中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

12 records (took 0.029 seconds)

    HASH-BASED DATA TRANSFER IN DISTRIBUTED DEDUPLICATION STORAGE SYSTEMS
    1.
    发明申请
    HASH-BASED DATA TRANSFER IN DISTRIBUTED DEDUPLICATION STORAGE SYSTEMS 审中-公开

    公开(公告)号：US20190026303A1

    公开(公告)日：2019-01-24

    申请号：US15652572

    申请日：2017-07-18

    Applicant: VMware, Inc.

    Inventor： Jorge GUERRA DELGADO ,  Eric KNAUFT ,  Gopala SURYANARAYANA ,  Sandeep RANGASWAMY ,  Srinath PREMACHANDRAN

    IPC: G06F17/30 ,  H04L29/08

    Abstract: Exemplary methods, apparatuses, and systems include a destination node receiving, from a source node, a hash of data stored by the source node and designated for transfer from the source node to the destination node. In response to determining the hash received from the source node maps to data stored by the destination node, the destination node reads the data into a write buffer and transmits an indication to the source node that the data is present at the source node. The destination node reads the data from write buffer and, in response to determining the data read from the write buffer remains unchanged as stored by the destination node, increases a reference count for the data as stored by the destination node.

    TRADING OFF CACHE SPACE AND WRITE AMPLIFICATION FOR B(epsilon)-TREES
    7.
    发明申请
    TRADING OFF CACHE SPACE AND WRITE AMPLIFICATION FOR B(epsilon)-TREES 审中-公开

    公开(公告)号：US20200233801A1

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

    申请号：US16252488

    申请日：2019-01-18

    Applicant: VMware, Inc.

    Inventor： Abhishek GUPTA ,  Robert T. JOHNSON ,  Richard P. SPILLANE ,  Sandeep RANGASWAMY ,  Jorge GUERRA DELGADO ,  Kapil CHOWKSEY ,  Srinath PREMACHANDRAN

    IPC: G06F12/0804 ,  G06F16/22 ,  G06F16/2455 ,  G06F7/16

    Abstract: Certain aspects provide systems and methods for performing an operation on a Bε-tree. A method comprises writing a message associated with the operation to a first slot in a first buffer of a first non-leaf node of the Bε-tree in an append-only manner, wherein a first filter associated with the first slot is used for query operations associated with the first slot. The method further comprises determining that the first buffer is full and, upon determining to flush the message to a non-leaf child node, flushing the message in an append-only manner to a second slot in a second buffer of the non-leaf child node, wherein a second filter associated with the second slot is used for query operations associated with the second slot. The method further comprises, upon determining to flush the message to a leaf node, flushing the message to the leaf node in a sorted manner.

    RANGE LOOKUP OPERATIONS FOR B E-TREES USING UPDATE MESSAGES
    8.
    发明申请
    RANGE LOOKUP OPERATIONS FOR B E-TREES USING UPDATE MESSAGES 审中-公开

    公开(公告)号：US20190294709A1

    公开(公告)日：2019-09-26

    申请号：US15927019

    申请日：2018-03-20

    Applicant: VMware, Inc.

    Inventor： Abhishek GUPTA ,  Rob T. JOHNSON ,  Srinath PREMACHANDRAN ,  Richard P. SPILLANE ,  Sandeep RANGASWAMY ,  Jorge GUERRA DELGADO ,  Kapil CHOWKSEY ,  Wenguang WANG

    IPC: G06F17/30

    Abstract: Exemplary methods, apparatuses, and systems include a file system process inserting a first key/value pair and a second key/value pair into a first tree. The second key is a duplicate of the first key and the value of the second key/value pair is an operation changing the value. In response to a request for a range of key/value pairs, the process reads the second key/value pair and inserts it in a second tree. The process reads the first pair and determines, while inserting the first pair in the second tree, that the second key is a duplicate of the first key. The file system process determines an updated value of the first value by applying the operation in the second value to first value. The file system operation updates the second key/value pair in the second tree with the updated value and returns the requested range of key/value pairs.

    METHOD AND SYSTEM FOR ROBUST MESSAGE RETRANSMISSION
    9.
    发明申请
    METHOD AND SYSTEM FOR ROBUST MESSAGE RETRANSMISSION 有权
    用于稳健消息重传的方法和系统

    公开(公告)号：US20160277152A1

    公开(公告)日：2016-09-22

    申请号：US14664497

    申请日：2015-03-20

    Applicant: VMware, Inc.

    Inventor： Enning XIANG ,  Jorge GUERRA DELGADO

    IPC: H04L1/08 ,  H04L1/16

    CPC classification number: H04L1/1848 ,  H04L1/1854 ,  H04L1/1874 ,  H04L1/1896

    Abstract: Techniques are disclosed for message retransmission. In one embodiment, an agent in a distributed system that receives and/or relays messages from a master node identifies messages that have not been successfully delivered, and adds a stub for each such message to a message queue. The agent then requests retransmission of missing messages in the message queue and sets flags associated with the message stubs to indicate that retransmission requests have been sent. If one (or more) of the messages cannot be retransmitted, the master node sends acknowledgment message(s) notifying the agent of the master node's inability to retransmit the messages. The agent then resets the flags corresponding to those messages to indicate that retransmission request(s) need to be sent again.

    Abstract translation: 公开了用于消息重传的技术。 在一个实施例中，从主节点接收和/或中继消息的分布式系统中的代理标识尚未成功传递的消息，并将每个这样的消息的存根添加到消息队列。 然后，代理请求在消息队列中重传丢失的消息，并设置与消息存根相关联的标志，以指示已发送重传请求。 如果一个（或多个）消息不能被重新发送，则主节点发送确认消息，通知代理人主节点不能重传消息。 然后代理复位与这些消息相对应的标志，以指示需要再次发送重传请求。

    BULK-LOAD FOR B-TREES
    10.
    发明申请
    BULK-LOAD FOR B-TREES 审中-公开

    公开(公告)号：US20200293506A1

    公开(公告)日：2020-09-17

    申请号：US16353535

    申请日：2019-03-14

    Applicant: VMware, Inc.

    Inventor： Abhishek GUPTA ,  Robert T. JOHNSON ,  Richard P. SPILLANE ,  Sandeep RANGASWAMY ,  Jorge GUERRA DELGADO ,  Srinath PREMACHANDRAN ,  Kapil CHOWKSEY

    IPC: G06F16/22 ,  G06F16/2455 ,  G06F7/08

    Abstract: Embodiments described herein are related to bulk loading data into a B-tree. Embodiments include generating a first leaf node of a B-tree by allocating a first page for the first leaf node from a leaf page queue comprising a first plurality of sequential pages; and writing one or more tuples to the first page allocated for the first leaf node. Embodiments further include generating an parent node for the first leaf node and a second leaf node of the B-tree by allocating a third page for the parent node from an parent page queue comprising a second plurality of sequential pages, the parent node comprising a first indication of the first leaf node and a second indication of the second leaf node, the first indication and the second indication stored in the third page allocated for the parent.

Patent Agency Ranking