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

被引:0
作者
Saeed Doostali
Seyed Morteza Babamir
Maryam Eini
机构
[1] University of Kashan,Department of Software Engineering
来源
Cluster Computing | 2021年 / 24卷
关键词
Critical path; Workflow scheduling; Multi-objective optimization; Grey Wolf optimization; Cloud computing;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:20
相关论文
共 89 条
[1]  
Singh S(2016)A survey on resource scheduling in cloud computing: issues and challenges J. Grid Comput. 14 217-264
[2]  
Chana I(2017)A study of the performance of a cloud datacenter server IEEE Trans. Cloud Comput. 5 590-603
[3]  
Mershad K(2013)Characterizing and profiling scientific workflows Future Gener. Comp. Syst. 29 682-692
[4]  
Artail H(2002)Performance-effective and low-complexity task scheduling for heterogeneous computing IEEE Trans. Parallel Distrib. Syst. 13 260-274
[5]  
Saghir MAR(2005)Extracting the workflow critical path from the extended well-formed workflow schema J. Comput. Syst. Sci. 70 86-106
[6]  
Hajj H(2016)Cost effective genetic algorithm for workflow scheduling in cloud under deadline constraint IEEE Access 4 5065-5082
[7]  
Awad M(2014)A budget constrained scheduling algorithm for workflow applications J. Grid Comp. 12 665-679
[8]  
Juve G(2009)Deadline division-based heuristic for cost optimization in workflow scheduling Inf. Sci. 179 2562-2575
[9]  
Chervenak AL(2013)Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds Future Gener. Comp. Syst. 29 158-169
[10]  
Deelman E(2016)Pcp-b Future Gener. Comp. Syst. 60 22-34