Distributed hierarchical scheduler
AssigneeVMware, Inc.
InventorsVadim SPIVAK, Amar PADMANABHAN, Anfernee Yongkun GUI, Badhri SAMPATHKUMAR, Luca CASTELLANO, Maithem MUNSHED, Michi MUTSUZAKI, Vui Chiap LAM
Life of this patent
Estimating the term…
Loading patent…
AssigneeVMware, Inc.
InventorsVadim SPIVAK, Amar PADMANABHAN, Anfernee Yongkun GUI, Badhri SAMPATHKUMAR, Luca CASTELLANO, Maithem MUNSHED, Michi MUTSUZAKI, Vui Chiap LAM
Estimating the term…
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.
A computer-implemented method of assigning a resource consumer to one of a plurality of resource buckets, comprising:
A non-transitory computer-readable storage medium containing a program which, when executed by one or more processors, performs operations for assigning a resource consumer to one of a plurality of resource buckets, the operations comprising:
A computer-implemented method of assigning a resource consumer to one of a plurality of resource buckets, comprising:
Dependencies are inferred from the claim text.