Cost and Energy Aware Scheduling Algorithm for Scientific Workflows with Deadline Constraint in Clouds

被引:115
作者
Li, Zhongjin [1 ,2 ]
Ge, Jidong [1 ,2 ]
Hu, Haiyang [2 ,3 ]
Song, Wei [4 ]
Hu, Hao [1 ]
Luo, Bin [1 ]
机构
[1] Nanjing Univ, Software Inst, State Key Lab Novel Software Technol, Nanjing, Jiangsu, Peoples R China
[2] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
[3] Hangzhou Dianzi Univ, Sch Comp Sci & Technol, Hangzhou, Zhejiang, Peoples R China
[4] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing, Jiangsu, Peoples R China
关键词
Workflow scheduling; cloud computing; energy aware; cost optimization; deadline constraint; BIG DATA; SERVICE; ENVIRONMENTS;
D O I
10.1109/TSC.2015.2466545
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud computing is a suitable platform to execute the deadline-constrained scientific workflows which are typical big data applications and often require many hours to finish. Moreover, the problem of energy consumption has become one of the major concerns in clouds. In this paper, we present a cost and energy aware scheduling (CEAS) algorithm for cloud scheduler to minimize the execution cost of workflow and reduce the energy consumption while meeting the deadline constraint. The CEAS algorithm consists of five sub-algorithms. First, we use the VM selection algorithm which applies the concept of cost utility to map tasks to their optimal virtual machine (VM) types by the sub-makespan constraint. Then, two tasks merging methods are employed to reduce execution cost and energy consumption of workflow. Further, In order to reuse the idle VM instances which have been leased, the VM reuse policy is also proposed. Finally, the scheme of slack time reclamation is utilized to save energy of leased VM instances. According to the time complexity analysis, we conclude that the time complexity of each sub-algorithm is polynomial. The CEAS algorithm is evaluated using Cloudsim and four real-world scientific workflow applications, which demonstrates that it outperforms the related well-known approaches.
引用
收藏
页码:713 / 726
页数:14
相关论文
共 44 条
[1]  
Agrawal K, 2010, IPDPS, P1, DOI [DOI 10.1109/IPDPS.2010.5470346, 10.1109/IPDPS.2010.5470403, DOI 10.1109/IPDPS.2010.5470403]
[2]  
[Anonymous], 2011, P INT C HIGH PERF CO
[3]  
[Anonymous], GRIDS CLOUDS VIRTUAL
[4]  
[Anonymous], 2010, EPRINT ARXIV
[5]  
[Anonymous], 2012, PROC IEEE INT C HIGH
[6]  
Balke Wolf-Tilo., 2004, VLDB, P936
[7]   Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing [J].
Beloglazov, Anton ;
Abawajy, Jemal ;
Buyya, Rajkumar .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2012, 28 (05) :755-768
[8]   CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms [J].
Calheiros, Rodrigo N. ;
Ranjan, Rajiv ;
Beloglazov, Anton ;
De Rose, Cesar A. F. ;
Buyya, Rajkumar .
SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (01) :23-50
[9]   An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements [J].
Chen, Wei-Neng ;
Zhang, Jun .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2009, 39 (01) :29-43
[10]   A Provenance-based Adaptive Scheduling Heuristic for Parallel Scientific Workflows in Clouds [J].
de Oliveira, Daniel ;
Ocana, Kary A. C. S. ;
Baiao, Fernanda ;
Mattoso, Marta .
JOURNAL OF GRID COMPUTING, 2012, 10 (03) :521-552