scheduling parallel jobs using migration and consolidation in the cloud调度并行使用云中的迁移和整合工作.pdf

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2012, Article ID 695757, 18 pages doi:10.1155/2012/695757 Research Article Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud Xiaocheng Liu, Bin Chen, Xiaogang Qiu, Ying Cai, and Kedi Huang System Simulation Lab, Mechatronics and Atuomation School, National University of Defense Technology, Hunan Province, Changsha, 410073, China Correspondence should be addressed to Xiaocheng Liu, nudt200203012007xcl@ Received 27 February 2012; Revised 26 June 2012; Accepted 5 July 2012 Academic Editor: Ruben Ruiz Garcıa ´ ´ Copyright q 2012 Xiaocheng Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. An increasing number of high performance computing parallel applications leverages the power of the cloud for parallel processing. How to schedule the parallel applications to improve the quality of service is the key to the successful host of parallel applications in the cloud. The large scale of the cloud makes the parallel job scheduling more complicated as even simple parallel job scheduling problem is NP-complete. In this paper, we propose a parallel job scheduling algorithm named MEASY. MEASY adopts migration and consolidation to enhance the most popular EASY scheduling algorithm. Our extensive experiments on well-known workloads show that our algorithm takes very good care of the quality of service. For two common parallel job scheduling objectives, our algorithm produces an up to 41.1% and an avera