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.

Abstract: A method for simulating a virtual computing environment includes specifying one or more flavors of resource consumers and one or more flavors of datastores to be provisioned on a tree of hosts for a simulation of a distributed virtualization scheduler. The method also includes generating a tree of hosts for the resource consumers and datastores based on the specified flavors and using a tree generator component of the distributed virtualization scheduler. The method further includes generating a plurality of resource consumer requests for the generated tree of hosts according to a pattern-based input, where the resource consumer requests include requests for the specified resource consumer flavors and the specified datastore flavors. The method also includes simulating execution of the resource consumer requests on the generated tree of hosts using the distributed virtualization scheduler, and utilizing a result of the simulated execution to improve a placement decision for a resource consumer.

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.

Abstract: A method for simulating a virtual computing environment includes specifying one or more flavors of resource consumers and one or more flavors of datastores to be provisioned on a tree of hosts for a simulation of a distributed virtualization scheduler. The method also includes generating a tree of hosts for the resource consumers and datastores based on the specified flavors and using a tree generator component of the distributed virtualization scheduler. The method further includes generating a plurality of resource consumer requests for the generated tree of hosts according to a pattern-based input, where the resource consumer requests include requests for the specified resource consumer flavors and the specified datastore flavors. The method also includes simulating execution of the resource consumer requests on the generated tree of hosts using the distributed virtualization scheduler, and utilizing a result of the simulated execution to improve a placement decision for a resource consumer.