Resource allocation algorithms for virtualized service hosting platforms

被引:165
作者
Stillwell, Mark [1 ]
Schanzenbach, David [1 ]
Vivien, Frederic [2 ]
Casanova, Henri [1 ]
机构
[1] Univ Hawaii Manoa, Dept Informat & Comp Sci, Honolulu, HI 96822 USA
[2] Univ Lyon, LIP, INRIA, ENS CNRS INRIA UCBL,UMR 5668, Lyon, France
关键词
Resource allocation; Virtual machine; Cluster; PERFORMANCE MANAGEMENT; BIN PACKING;
D O I
10.1016/j.jpdc.2010.05.006
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Commodity clusters are used routinely for deploying service hosting platforms. Due to hardware and operation costs, clusters need to be shared among multiple services. Crucial for enabling such shared hosting platforms is virtual machine (VM) technology, which allows consolidation of hardware resources. A key challenge, however, is to make appropriate decisions when allocating hardware resources to service instances. In this work we propose a formulation of the resource allocation problem in shared hosting platforms for static workloads with servers that provide multiple types of resources. Our formulation supports a mix of best-effort and QoS scenarios, and, via a precisely defined objective function, promotes performance, fairness, and cluster utilization. Further, this formulation makes it possible to compute a bound on the optimal resource allocation. We propose several classes of resource allocation algorithms, which we evaluate in simulation. We are able to identify an algorithm that achieves average performance close to the optimal across many experimental scenarios. Furthermore, this algorithm runs in only a few seconds for large platforms and thus is usable in practice. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:962 / 974
页数:13
相关论文
共 67 条
[1]   Static heuristics for robust resource allocation of continuously executing applications [J].
Ali, Shoukat ;
Kim, Jong-Kook ;
Siegel, Howard Jay ;
Maciejewski, Anthony A. .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2008, 68 (08) :1070-1080
[2]  
[Anonymous], P USENIX ANN TECHN C
[3]  
[Anonymous], ILOG CPLEX HIGH PERF
[4]  
[Anonymous], 2003, P USENIX S INT TECHN
[5]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[6]  
[Anonymous], 2005, HPL2005187
[7]  
Aron M., 2000, P ACM SIGM INT C MEA
[8]  
BANSAL N, 2006, FOCS 2006, P697
[9]  
Barham P., 2003, Operating Systems Review, V37, P164, DOI 10.1145/1165389.945462
[10]  
Bender M.A., 1998, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, P270