arrow
返回

Look-ahead workflow scheduling with width changing trend in clouds

delete2023-02-01
delete13
PRE
AI
L
Liwen Yang
L
Lingjuan Ye
Y
Yuanqing Xia
Y
Yufeng Zhan *
DOI:10.1016/j.future.2022.09.013delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
With the migration of more and more workflows to clouds, cloud workflow scheduling becomes the main bottleneck for meeting user's Quality of Service (QoS) due to the dependency between tasks in a workflow and the elasticity of cloud resources. Besides, the pricing model of cloud resources causes the workflow execution time (WET) and workflow execution cost (WEC) to be critical in workflow scheduling. In this paper, we investigate how to optimize WEC under WET as a deadline constraint for workflow scheduling in clouds and propose a look-ahead workflow scheduling algorithm with width changing trend (W-LA) to solve it. First, we come up with the concept of the width changing trend of a workflow. On the basis of this concept, we define the priority of each task and design a novel deadline distribution strategy to distribute the deadline constraint to each task suitably. Then, we propose a look-ahead instance selection framework (LAISF), where selecting instance not only is based on the impact of the selection on the task being assigned, but also looks ahead in the scheduling to consider the impact of this selection on this task's subsequent tasks. Finally, based on them, W-LA follows a three-step heuristic scheduling: rank tasks by their priorities, distribute the deadline constraint and select instances for tasks by LAISF. W-LA is compared with the state-of-the-art algorithms, including IC-PCP, ProLiS, PSO, ADBRKGA and L-ACO. Experimental results on five real-world scientific workflows demonstrate that W-LA outperforms the five algorithms on average by 41.33%, 33.29%, 96.88%, 86.37% and 14.36% in terms of WEC.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Look-ahead
Width changing trend
Deadline distribution
Cloud computing
Workflow scheduling
Constrained optimization

期刊

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
论文数:
6.9K
被引数:
2.3W

机构

B
beijing institute of technology
学者数:
5.5W
论文数: 4.0W
被引数: 63
引用论文

引用论文

err分享
err收藏
Genetic-based algorithms applied to a workflow scheduling algorithm with security and deadline constraints in clouds
err2018-07-01
err64
PREAI
errShishido, Henrique Yoshikazu; Estrella, Julio Cezar; Motta Toledo, Claudio Fabiano; Arantes, Marcio Silva
err分享
err收藏
Multiobjective Cloud Workflow Scheduling: A Multiple Populations Ant Colony System Approach
err2019-08-01
err204
errOAAI
errChen, Zong-Gan; Zhan, Zhi-Hui; Lin, Ying; Gong, Yue-Jiao; Gu, Tian-Long; Zhao, Feng; Yuan, Hua-Qiang; Chen, Xiaofeng; Li, Qing; Zhang, Jun
err分享
err收藏
err分享
err收藏
学者 查看更多内容