公开(公告)号：US20200065408A1

公开(公告)日：2020-02-27

申请号：US16112698

申请日：2018-08-25

Applicant: VMware, Inc.

Inventor： Asit DESAI ,  Derek ULUSKI ,  Alexander T. GARTHWAITE ,  Sunil Satnur ,  Ilya LANGUEV ,  Tan Li ,  Raveesh AHUJA

IPC: G06F17/30

Abstract: System and method for managing space in storage object structures stored in a storage system uses an object B tree structure to manage a storage object in a storage object structure in the storage system, which provides virtual physical block addresses for data of the storage object and for metadata of nodes of the object B tree structure. The metadata of the nodes of the object B tree structure is written in the storage object structure using first real physical block addresses, which are translated from the virtual block addresses for the metadata of the nodes of the object B tree structure using a metadata system file B tree structure. The data of the storage object is written in the storage object structure using second real physical block addresses, which are translated from the virtual block addresses for the data of the storage object using a data system file B tree structure.

公开(公告)号：US11334545B2

公开(公告)日：2022-05-17

申请号：US16112698

申请日：2018-08-25

Applicant: VMware, Inc.

Inventor： Asit Desai ,  Derek Uluski ,  Alexander T. Garthwaite ,  Sunil Satnur ,  Ilya Languev ,  Tan Li ,  Raveesh Ahuja

IPC: G06F16/22

Abstract: System and method for managing space in storage object structures stored in a storage system uses an object B tree structure to manage a storage object in a storage object structure in the storage system, which provides virtual physical block addresses for data of the storage object and for metadata of nodes of the object B tree structure. The metadata of the nodes of the object B tree structure is written in the storage object structure using first real physical block addresses, which are translated from the virtual block addresses for the metadata of the nodes of the object B tree structure using a metadata system file B tree structure. The data of the storage object is written in the storage object structure using second real physical block addresses, which are translated from the virtual block addresses for the data of the storage object using a data system file B tree structure.

公开(公告)号：US20200175074A1

公开(公告)日：2020-06-04

申请号：US16209965

申请日：2018-12-04

Applicant: VMware, Inc.

Inventor： Tan Li ,  Zhihao Yao ,  Sunil Satnur ,  Kiran Joshi

IPC: G06F16/901 ,  G06F12/0871 ,  G06F12/0891

Abstract: Nodes in tree data structure can be cached in a cache memory. When the cache memory becomes full, an eviction policy selects cached nodes based on their location in the tree data structure. The eviction policy selects cached nodes that correspond to leaf nodes in the tree data structure as candidates for eviction. The eviction policy selects cached nodes that correspond to internal (non-leaf) nodes from the lowest level possible for eviction, only if there are no cached leaf nodes.

公开(公告)号：US20200142828A1

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

申请号：US16178515

申请日：2018-11-01

Applicant: VMware, Inc.

Inventor： Zhihao Yao ,  Tan Li ,  Sunil Satnur ,  Kiran Joshi

IPC: G06F12/084

Abstract: A shared cache memory can be logically partitioned among different workloads to provide isolation between workloads and avoid excessive resource contention. Each logical partition is apportioned a share of the cache memory, and is exclusive to a respective one of the workloads. Each partition has an initial size allocation. Historical data can be collected and processed for each partition and used to periodically update its size allocation.

公开(公告)号：US10747668B2

公开(公告)日：2020-08-18

申请号：US16178515

申请日：2018-11-01

Applicant: VMware, Inc.

Inventor： Zhihao Yao ,  Tan Li ,  Sunil Satnur ,  Kiran Joshi

IPC: G06F12/08 ,  G06F12/084

Abstract: A shared cache memory can be logically partitioned among different workloads to provide isolation between workloads and avoid excessive resource contention. Each logical partition is apportioned a share of the cache memory, and is exclusive to a respective one of the workloads. Each partition has an initial size allocation. Historical data can be collected and processed for each partition and used to periodically update its size allocation.