-
公开(公告)号：US11061881B2
公开(公告)日：2021-07-13
申请号：US16184861
申请日：2018-11-08
Applicant: VMware, Inc.
Inventor： Robert T Johnson , Abhishek Gupta , Jorge Guerra Delgado , Ittai Abraham , Richard P Spillane , Srinath Premachandran , Sandeep Rangaswamy , Kapil Chowksey
IPC: G06F16/22
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号：US10649959B2
公开(公告)日：2020-05-12
申请号：US15717613
申请日：2017-09-27
Applicant: VMware, Inc.
Inventor： Abhishek Gupta , Richard P Spillane , Kapil Chowksey , Wenguang Wang , Robert T Johnson
Abstract: A Bε-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion that can be characterized by a fixed maximum allowable size to store key-value pairs as messages in the buffer. Messages can be initially buffered in the root node of the Bε-tree, and flushed to descendent children from the root node. Messages stored in the buffers can be indexed using a B+-tree data structure. As the B+-tree data structure in a buffer grows (due to receiving flushed messages) and shrinks (due to messages being flushed), disk blocks can be allocated from the storage volume to increase the actual size of the buffer and deallocated from the buffer to reduce the actual size of the buffer.
-
公开(公告)号：US11334498B2
公开(公告)日：2022-05-17
申请号：US16551761
申请日：2019-08-27
Applicant: VMware, Inc.
Inventor： Kamal Jeet Charan , Adrian Drzewiecki , Mounesh Badiger , Pushpesh Sharma , Wenguang Wang , Maxime Austruy , Richard P Spillane
IPC: G06F12/1009 , G06F16/182 , G06F9/455
Abstract: A system and method for transferring data between a user space buffer in the address space of a user space process running on a virtual machine and a storage system are described. The user space buffer is represented as a file with a file descriptor. In the method, a file system proxy receives a request for I/O read or write from the user space process without copying data to be transferred. The file system proxy then sends the request to a file system server without copying data to be transferred. The file system server then requests that the storage system perform the requested I/O directly between the storage system and the user space buffer, the only transfer of data being between the storage system and the user space buffer.
-
公开(公告)号：US10824610B2
公开(公告)日：2020-11-03
申请号：US16134564
申请日：2018-09-18
Applicant: VMware, Inc.
Inventor： Robert T Johnson , Ittai Abraham , Abhishek Gupta , Richard P Spillane , Srinath Premachandran , Jorge Guerra Delgado , Sandeep Rangaswamy , Kapil Chowksey
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号：US11093450B2
公开(公告)日：2021-08-17
申请号：US15717704
申请日：2017-09-27
Applicant: VMware, Inc.
Inventor： Wenguang Wang , Abhishek Gupta , Richard P Spillane , Kapil Chowksey , Robert T Johnson
Abstract: A Bε-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion to store key-value pairs as messages in the buffer. Each node can be characterized by having a maximum allowable size that is periodically updated at run time. The buffers in the nodes of the Bε-tree are therefore characterized by having a maximum allowed size that can vary over time.
-
Patent Agency Ranking
公开(公告)号：US20190095457A1
公开(公告)日：2019-03-28
申请号：US15717613
申请日：2017-09-27
Applicant: VMware, Inc.
Inventor： Abhishek Gupta , Richard P Spillane , Kapil Chowksey , Wenguang Wang , Robert T Johnson
Abstract: A Bε-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion that can be characterized by a fixed maximum allowable size to store key-value pairs as messages in the buffer. Messages can be initially buffered in the root node of the Bε-tree, and flushed to descendent children from the root node. Messages stored in the buffers can be indexed using a B+-tree data structure. As the B+-tree data structure in a buffer grows (due to receiving flushed messages) and shrinks (due to messages being flushed), disk blocks can be allocated from the storage volume to increase the actual size of the buffer and deallocated from the buffer to reduce the actual size of the buffer.
-
公开(公告)号：US10997144B2
公开(公告)日：2021-05-04
申请号：US16029463
申请日：2018-07-06
Applicant: VMware, Inc.
Inventor： Robert T Johnson , Ittai Abraham , Abhishek Gupta , Richard P Spillane , Sandeep Rangaswamy , Jorge Guerra Delgado , Srinath Premachandran , Kapil Chowksey
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号：US20200012735A1
公开(公告)日：2020-01-09
申请号：US16029463
申请日：2018-07-06
Applicant: VMware, Inc.
Inventor： Robert T Johnson , Ittai Abraham , Abhishek Gupta , Richard P Spillane , Sandeep Rangaswamy , Jorge Guerra Delgado , Srinath Premachandran , Kapil Chowksey
IPC: G06F17/30
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号：US10515052B2
公开(公告)日：2019-12-24
申请号：US15655218
申请日：2017-07-20
Applicant: VMware, Inc.
Inventor： Wenguang Wang , Richard P Spillane
IPC: G06F16/14
Abstract: A file system stores directories and files in a file system directory that uses case sensitive names. The same file system directory can support directory and file name lookups that treat the directory and file names in a case sensitive manner or in a case insensitive manner. The search criteria used for the lookup can be based on case-folding the name to produce a case-neutral name and on the original name with its case preserved. Search criteria can be generated for a case sensitive name lookup or for a case insensitive name lookup on the same file system directory, thus avoiding having to support separate file systems or separate file system directories for case sensitive and case insensitive file access.
-
公开(公告)号：US20190095460A1
公开(公告)日：2019-03-28
申请号：US15717704
申请日：2017-09-27
Applicant: VMware, Inc.
Inventor： Wenguang Wang , Abhishek Gupta , Richard P Spillane , Kapil Chowksey , Robert T Johnson
Abstract: A Bε-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion to store key-value pairs as messages in the buffer. Each node can be characterized by having a maximum allowable size that is periodically updated at run time. The buffers in the nodes of the Bε-tree are therefore characterized by having a maximum allowed size that can vary over time.
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.013 seconds)
