Elastic Scheduling of Scientific Workflows under Deadline Constraints in Cloud Computing Environments

被引:40
作者
Anwar, Nazia [1 ,2 ]
Deng, Huifang [1 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Guangdong, Peoples R China
[2] Univ Educ, Dept Comp Sci, Lahore 54770, Pakistan
关键词
IaaS cloud; scientific workflow; resource provisioning; scheduling; cost minimization; deadline-constrained;
D O I
10.3390/fi10010005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Scientific workflow applications are collections of several structured activities and fine-grained computational tasks. Scientific workflow scheduling in cloud computing is a challenging research topic due to its distinctive features. In cloud environments, it has become critical to perform efficient task scheduling resulting in reduced scheduling overhead, minimized cost and maximized resource utilization while still meeting the user-specified overall deadline. This paper proposes a strategy, Dynamic Scheduling of Bag of Tasks based workflows (DSB), for scheduling scientific workflows with the aim to minimize financial cost of leasing Virtual Machines (VMs) under a user-defined deadline constraint. The proposed model groups the workflow into Bag of Tasks (BoTs) based on data dependency and priority constraints and thereafter optimizes the allocation and scheduling of BoTs on elastic, heterogeneous and dynamically provisioned cloud resources called VMs in order to attain the proposed method's objectives. The proposed approach considers pay-as-you-go Infrastructure as a Service (IaaS) clouds having inherent features such as elasticity, abundance, heterogeneity and VM provisioning delays. A trace-based simulation using benchmark scientific workflows representing real world applications, demonstrates a significant reduction in workflow computation cost while the workflow deadline is met. The results validate that the proposed model produces better success rates to meet deadlines and cost efficiencies in comparison to adapted state-of-the-art algorithms for similar problems.
引用
收藏
页数:23
相关论文
共 35 条
[1]   Tavaxy: Integrating Taverna and Galaxy workflows with cloud computing support [J].
Abouelhoda, Mohamed ;
Issa, Shadi Alaa ;
Ghanem, Moustafa .
BMC BIOINFORMATICS, 2012, 13
[2]   Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds [J].
Abrishami, Saeid ;
Naghibzadeh, Mahmoud ;
Epema, Dick H. J. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (01) :158-169
[3]   Low-time complexity budget-deadline constrained workflow scheduling on heterogeneous resources [J].
Arabnejad, Hamid ;
Barbosa, Jorge G. ;
Prodan, Radu .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 55 :29-40
[4]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[5]   Cost optimized provisioning of elastic resources for application workflows [J].
Byun, Eun-Kyu ;
Kee, Yang-Suk ;
Kim, Jin-Soo ;
Maeng, Seungryoul .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2011, 27 (08) :1011-1026
[6]  
Cai Z. L., 2017, IEEE T CLOUD COMPUT, P1
[7]   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
[8]  
Chen W., 2011, P 6 WORKSH WORKFL SU, P11, DOI [DOI 10.1145/2110497.2110500, 10.1007/978-3-642-31500-82]
[9]   Using imbalance metrics to optimize task clustering in scientific workflow executions [J].
Chen, Weiwei ;
da Silva, Rafael Ferreira ;
Deelman, Ewa ;
Sakellariou, Rizos .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2015, 46 :69-84
[10]  
da Silva RF, 2013, LECT NOTES COMPUT SC, V8097, P255, DOI 10.1007/978-3-642-40047-6_28