Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud

• Published in: Mathematical Problems in Engineering Vol. 2012; no. 2012; pp. 1002 - 1019-463
• Main Authors: Cai, Ying, Qiu, Xiaogang, Chen, Bin, Liu, Xiaocheng, Huang, Kedi
• Format: Journal Article
• Language: English
• Published: Cairo, Egypt Hindawi Limiteds 01.01.2012; Hindawi Publishing Corporation; Hindawi Limited
• Subjects: Algorithms; Cloud computing; Consolidation; Costs; Migration; Parallel processing; Quality of service; Response time; Scheduling
• ISSN: 1024-123X; 1563-5147
• DOI: 10.1155/2012/695757

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 average of 23.1% improvement on the average response time; an up to 82.9% and an average of 69.3% improvement on the average slowdown. Our algorithm is robust even in terms that it allows inaccurate CPU usage estimation and high migration cost. Our approach involves trivial modification on EASY and requires no additional technique; it is practical and effective in the cloud environment.