公开(公告)号：US20200226060A1

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

申请号：US16246416

申请日：2019-01-11

Applicant: VMware, Inc.

Inventor： Michael Wei ,  Maithem Munshed ,  Anny Martinez Manzanilla ,  Zeeshan Altaf Lokhandwala ,  Saeed A. Behnam ,  Medhavi Dhawan ,  Dahlia Malkhi

IPC: G06F12/02 ,  G06F3/06

Abstract: A log unit provides a shared log for recording updates on data objects. Garbage collection is performed locally and in-place by the log unit. In a marking portion of the garbage collection process, the log unit identifies and marks log entries that record mergeable updates. In a deallocation portion of the process, the log unit merges one or more mergeable log entries and deallocates at least portions of the merged log entries.

公开(公告)号：US20200186455A1

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

申请号：US16211027

申请日：2018-12-05

Applicant: VMware, Inc.

Inventor： Zeeshan Lokhandwala ,  Medhavi Dhawan ,  Dahlia Malkhi ,  Michael Wei ,  Maithem Munshed ,  Ragnar Edholm

IPC: H04L12/26 ,  H04L12/24 ,  H04L12/707

Abstract: Techniques for implementing dynamic timeout-based fault detection in a distributed system are provided. In one set of embodiments, a node of the distributed system can set a timeout interval to a minimum value and transmit poll messages to other nodes in the distributed system. The node can further wait for acknowledgement messages from all of the other nodes, where the acknowledgement messages are responsive to the poll messages, and can check whether it has received the acknowledgement messages from all of the other nodes within the timeout interval. If the node has failed to receive an acknowledgement message from at least one of the other nodes within the timeout interval and if the timeout interval is less than a maximum value, the node can increment the timeout interval by a delta value and can repeat the setting, the transmitting, the waiting, and the checking steps.

公开(公告)号：US10552228B2

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

申请号：US15187772

申请日：2016-06-20

Applicant: VMware, Inc.

Inventor： Vadim Spivak ,  Amar Padmanabhan ,  Anfernee Yongkun Gui ,  Badhri Sampathkumar ,  Luca Castellano ,  Maithem Munshed ,  Michi Mutsuzaki ,  Vui Chiap Lam

IPC: G06F9/50 ,  G06F9/48

Abstract: Techniques disclosed herein provide an approach for assigning resource consumers to available resources. In one embodiment, components of a distributed scheduler are organized into a hierarchy, such as a tree. A placement request received at a root scheduler of the hierarchy is propagated down the hierarchy, either to all children or to randomly selected subsets of children of each scheduler in the hierarchy. Leaf schedulers in the hierarchy that receive the request each propagate back up a score indicating the amount of free resources in its corresponding resource bucket. Branch schedulers then compare scores that they receive, and each further propagate one of the received scores, such as the highest score, based on the comparison, until the root scheduler is reached. The root scheduler makes an additional comparison and returns one of the resource buckets in response to the received placement request.

公开(公告)号：US10305745B2

公开(公告)日：2019-05-28

申请号：US15187774

申请日：2016-06-20

Applicant: VMware, Inc.

Inventor： Vadim Spivak ,  Maithem Munshed ,  Amar Padmanabhan ,  Michi Mutsuzaki

IPC: H04L12/24

Abstract: Techniques disclosed herein provide an approach for creating and managing aggregation service hierarchies, such as hierarchies used in distributed scheduling services and heartbeat services. In one embodiment, management nodes accept host computer registration events and add host computers to a hierarchy used as the aggregation mechanism in an aggregation service. The management nodes each manage a portion of the hierarchy and configure registered hosts to take the roles of leaf, branch, and root nodes in the hierarchy. Further, the management nodes dynamically mutate the hierarchy by reassigning host roles, in response to host additions and failures, thereby maximizing fault tolerance/high availability and efficiency.