Optimization of Composite Cloud Service Processing with Virtual Machines

被引:18
作者
Di, Sheng [1 ]
Kondo, Derrick [2 ]
Wang, Cho-Li [3 ]
机构
[1] Argonne Natl Lab, MCS Div, Argonne, IL 60439 USA
[2] INRIA, Grenoble, France
[3] Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
关键词
Cloud resource allocation; task scheduling; resource allocation; virtual machine; minimization of overhead;
D O I
10.1109/TC.2014.2329685
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
By leveraging virtual machine (VM) technology, we optimize cloud system performance based on refined resource allocation, in processing user requests with composite services. Our contribution is three-fold. (1) We devise a VM resource allocation scheme with a minimized processing overhead for task execution. (2) We comprehensively investigate the best-suited task scheduling policy with different design parameters. (3) We also explore the best-suited resource sharing scheme with adjusted divisible resource fractions on running tasks in terms of Proportional-share model (PSM), which can be split into absolute mode (called AAPSM) and relative mode (RAPSM). We implement a prototype system over a cluster environment deployed with 56 real VM instances, and summarized valuable experience from our evaluation. As the system runs in short supply, lightest workload first (LWF) is mostly recommended because it can minimize the overall response extension ratio (RER) for both sequential-mode tasks and parallel-mode tasks. In a competitive situation with over-commitment of resources, the best one is combining LWF with both AAPSM and RAPSM. It outperforms other solutions in the competitive situation, by 16 + % w.r.t. the worst-case response time and by 7.4 + % w.r.t. the fairness.
引用
收藏
页码:1755 / 1768
页数:14
相关论文
共 35 条
[11]  
Fox Armando, 2009, Above the Clouds: a Berkeley View of Cloud Computing
[12]   Adaptive grid job scheduling with genetic algorithms [J].
Gao, Y ;
Rong, HQ ;
Huang, JZ .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2005, 21 (01) :151-161
[13]  
Ghosh R., 2012, 2012 IEEE 5th International Conference on Cloud Computing (CLOUD), P25, DOI 10.1109/CLOUD.2012.131
[14]  
Gupta D, 2006, LECT NOTES COMPUT SC, V4290, P342
[15]  
Imamagic E, 2006, ITI 2006: PROCEEDINGS OF THE 28TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, P625, DOI 10.1109/ITI.2006.1708553
[16]  
Isard M, 2009, SOSP'09: PROCEEDINGS OF THE TWENTY-SECOND ACM SIGOPS SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES, P261
[17]  
Jiang CF, 2007, LECT NOTES COMPUT SC, V4505, P419
[18]  
Kaur Shaminder, 2012, International Journal of Information Technology and Computer Science, V4, P74, DOI 10.5815/ijitcs.2012.10.09
[19]  
Lagar-Cavilla HA, 2009, EUROSYS'09: PROCEEDINGS OF THE FOURTH EUROSYS CONFERENCE, P1
[20]   Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems [J].
Maheswaran, M ;
Ali, S ;
Siegel, HJ ;
Hensgen, D ;
Freund, RF .
(HCW '99) - EIGHTH HETEROGENEOUS COMPUTING WORKSHOP, PROCEEDINGS, 1999, :30-44