Vmware, Inc.

Luca Castellano

Amar Padmanabhan

Vadim Spivak

Maithem Munshed

Michi Mutsuzaki

Vui Chiap Lam

Anfernee Yongkun Gui

Badhri Sampathkumar

A distributed scheduler for a virtualized computer system has a hierarchical structure and includes a root scheduler as the root node, one or more branch schedulers as intermediate nodes, and a plurality of hosts as leaf nodes. A request to place a virtual computing instance is propagated down the hierarchical structure to the hosts that satisfy placement constraints of the request. Each host that receives the request responds with a score indicating resource availability on that host, and the scores are propagated back up the hierarchical structure. Branch schedulers that receive such scores compare the received scores and further propagate a 'winning' score, such as the highest or lowest score, up the hierarchical structure, until the root scheduler is reached. The root scheduler makes a similar comparison of received scores to select the best candidate among the hosts to place the virtual computing instance.

Constrained placement in hierarchical randomized schedulers

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.

Distributed hierarchical scheduler

In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction.

Distributed, transactional key-value store

Growing community of inventors

San Francisco, CA, United States of America

Luca Castellano