CP-PGWO: multi-objective workflow scheduling for cloud computing using critical path

被引:19
作者
Doostali, Saeed [1 ]
Babamir, Seyed Morteza [1 ]
Eini, Maryam [1 ]
机构
[1] Univ Kashan, Dept Software Engn, Kashan, Iran
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2021年 / 24卷 / 04期
关键词
Critical path; Workflow scheduling; Multi-objective optimization; Grey Wolf optimization; Cloud computing; SCIENTIFIC WORKFLOWS; GENETIC ALGORITHM; PERFORMANCE; OPTIMIZATION; TIME;
D O I
10.1007/s10586-021-03351-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
When each task of the longest path in a task-dependent scientific workflow must meet a deadline, the path is called critical. Tasks in a critical path have priority over tasks in non-critical paths. Considering this fact that less methods have already dealt with the critical path problem for workflow scheduling in cloud, this study aims to present a critical-path based method to consider the problem based on our previous optimal workflow scheduling method, GWO-based (Grey Wolf Optimization). We applied our study to balance and imbalance scientific workflows. Our results show that considering the critical path improves the completion time of workflows while maintaining a proper level of resource cost and resource utilization. Moreover, to show the effectiveness of the current study, we compared the performance of the proposed method with non-critical-path aware algorithms, using three different indicators. The simulation demonstrates that compared to PGWO as the base method, the proposed approach achieves (1) approximately 68% improvement for makespan, (2) more accuracy in population sampling for about 70% of workflows, and (3) avoidance of the cost increases in more than 50% of workflows. Moreover, the proposed method decreases makespan approximately 3 times compared to the constrained-based approaches.
引用
收藏
页码:3607 / 3627
页数:21
相关论文
共 47 条
[1]   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
[2]   A Budget Constrained Scheduling Algorithm for Workflow Applications [J].
Arabnejad, Hamid ;
Barbosa, Jorge G. .
JOURNAL OF GRID COMPUTING, 2014, 12 (04) :665-679
[3]   Scheduling deadline constrained scientific workflows on dynamically provisioned cloud resources [J].
Arabnejad, Vahid ;
Bubendorfer, Kris ;
Ng, Bryan .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2017, 75 :348-364
[4]   A Deadline Constrained Critical Path Heuristic for Cost-effectively Scheduling Workflows [J].
Arabnejad, Vahid ;
Bubendorfer, Kris ;
Ng, Bryan ;
Chard, Kyle .
2015 IEEE/ACM 8TH INTERNATIONAL CONFERENCE ON UTILITY AND CLOUD COMPUTING (UCC), 2015, :242-250
[5]   A Practical Guide for Using Statistical Tests to Assess Randomized Algorithms in Software Engineering [J].
Arcuri, Andrea ;
Briand, Lionel .
2011 33RD INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE), 2011, :1-10
[6]  
Cai ZC, 2013, LECT NOTES COMPUT SC, V8274, P207, DOI 10.1007/978-3-642-45005-1_15
[7]   Multiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach [J].
Chen, Zong-Gan ;
Zhan, Zhi-Hui ;
Lin, Ying ;
Gong, Yue-Jiao ;
Gu, Tian-Long ;
Zhao, Feng ;
Yuan, Hua-Qiang ;
Chen, Xiaofeng ;
Li, Qing ;
Zhang, Jun .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (08) :2912-2926
[8]  
Cheng WD, 2012, STRUCT BOND, V144, P1, DOI [10.1007/430_2011_64, 10.1109/ICADE.2012.6330087]
[9]  
De Smith M.J., 2018, Statistical analysis handbook
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197