Alexey Tumanov
ABSTRACT
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.
- Hadoop, 2012. http://hadoop.apache.org.Google Scholar
- G. Ananthanarayanan, A. Ghodsi, S. Shenker, and I. Stoica. Disk-locality in datacenter computing considered irrelevant. In Proc. of the 13th USENIX Conference on Hot Topics in Operating Systems, HotOS'13, pages 12--12. USENIX Association, 2011. Google ScholarDigital Library
- A. D. Ferguson, P. Bodik, S. Kandula, E. Boutin, and R. Fonseca. Jockey: guaranteed job latency in data parallel clusters. In Proc. of the 7th ACM european conference on Computer Systems, EuroSys '12, pages 99--112, 2012. Google ScholarDigital Library
- B. Hindman, A. Konwinski, M. Zaharia, A. Ghodsi, A. Joseph, R. Katz, S. Shenker, and I. Stoica. Mesos: A platform for fine-grained resource sharing in the data center. In Proc. of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI'11), 2011. Google ScholarDigital Library
- T. Kelly. Utility-directed allocation. Technical Report HPL-2003-115, Internet Systems and Storage Laboratory, HP Labs, June 2003.Google Scholar
- T. Kelly. Combinatorial auctions and knapsack problems. In Proc. of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3, AAMAS '04, pages 1280--1281, 2004. Google ScholarDigital Library
- M. Kozuch, M. Ryan, R. Gass, S. Schlosser, D. O'Hallaron, J. Cipar, E. Krevat, J. López, M. Stroucken, and G. Ganger. Tashi: location-aware cluster management. In Proc. of the 1st Workshop on Automated Control for Datacenters and Clouds, 2009. Google ScholarDigital Library
- K. Lai. Markets are dead, long live markets. SIGecom Exch., 5(4): 1--10, July 2005. Google ScholarDigital Library
- K. Lai, L. Rasmusson, E. Adar, L. Zhang, and B. A. Huberman. Tycoon: An implementation of a distributed, market-based resource allocation system. Multiagent Grid Syst., 1(3): 169--182, Aug. 2005. Google ScholarDigital Library
- C. B. Lee and A. E. Snavely. Precise and realistic utility functions for user-centric performance analysis of schedulers. In Proc. of the 16th international symposium on High performance distributed computing, HPDC '07, pages 107--116. ACM, 2007. Google ScholarDigital Library
- C. Reiss, A. Tumanov, G. R. Ganger, R. H. Katz, and M. A. Kozuch. Heterogeneity and dynamicity of clouds at scale: Google trace analysis. In Proc. of the 3nd ACM Symposium on Cloud Computing, SOCC '12, 2012. Google ScholarDigital Library
- C. Reiss, A. Tumanov, G. R. Ganger, R. H. Katz, and M. A. Kozuch. Towards understanding heterogeneous clouds at scale: Google trace analysis. Technical Report ISTC-CC-TR-12-101, Intel Science and Technology Center for Cloud Computing, Apr 2012.Google Scholar
- B. Sharma, V. Chudnovsky, J. L. Hellerstein, R. Rifaat, and C. R. Das. Modeling and synthesizing task placement constraints in Google compute clusters. In Proc. of the 2nd ACM Symposium on Cloud Computing, SOCC '11, pages 3: 1--3: 14. ACM, 2011. Google ScholarDigital Library
- I. Stoica, H. Abdel-wahab, and A. Pothen. A microeconomic scheduler for parallel computers. In Proc. of the Workshop on Job Scheduling Strategies for Parallel Processing, pages 122--135. Springer-Verlag, 1994. Google ScholarDigital Library
- J. Wilkes. Utility functions, prices, and negotiation. Technical Report HPL-2008-81, HP Labs, July 2008.Google Scholar
Index Terms
- alsched: algebraic scheduling of mixed workloads in heterogeneous clouds
Recommendations
Stratus: cost-aware container scheduling in the public cloud
SoCC '18: Proceedings of the ACM Symposium on Cloud ComputingStratus is a new cluster scheduler specialized for orchestrating batch job execution on virtual clusters, dynamically allocated collections of virtual machine instances on public IaaS platforms. Unlike schedulers for conventional clusters, Stratus ...
A Conceptual Platform of SLA in Cloud Computing
DASC '11: Proceedings of the 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure ComputingCloud computing is a promising technology, where the infrastructure, developing platform, software and storage are delivered as a service. With the development of cloud computing, more and more cloud service providers emerge. However, there are no ...
The Grand CRU Challenge
HotConNet '17: Proceedings of the Workshop on Hot Topics in Container Networking and Networked SystemsOne of the main objectives of any cluster management system is the maximization of cluster resource utilization (CRU). In this paper, we argue that there is a dilemma underlying the challenge of maximizing CRU, as soon as network resources enter the ...
Comments