PDL ABSTRACT

alsched: Algebraic Scheduling of Mixed Workloads in Heterogeneous Clouds

3rd ACM Symposium on Cloud Computing. October 14th-17th, 2012 - San Jose, CA.

Alexey Tumanov, James Cipar, Michael A. Kozuch*, Gregory R. Ganger

Electrical and Computer Engineering
Carnegie Mellon University
Pittsburgh, PA 15213

* Intel Labs

http://www.pdl.cmu.edu/

As cloud resources and applications grow more heterogeneous, allocating the right resources to different tenants' activities increasingly depends upon understanding tradeoffs regarding their individual behaviors. One may require a specific amount of RAM, another may benefit from a GPU, and a third may benefit from executing on the same rack as a fourth. This paper promotes the need for and an approach for accommodating diverse tenant needs, based on having resource requests indicate any soft (i.e., when certain resource types would be better, but are not mandatory) and hard constraints in the form of composable utility functions. A scheduler that accepts such requests can then maximize overall utility, perhaps weighted by priorities, taking into account application specifics. Experiments with a prototype scheduler, called alsched, demonstrate that support for soft constraints is important for efficiency in multi-purpose clouds and that composable utility functions can provide it.

KEYWORDS: cluster scheduling, cloud computing

FULL PAPER: pdf

 


 

 

 

© 2014. Last updated 4 October, 2012