| An Effective Cloud Workflow Scheduling Approach Combining PSO and Idle Time Slot-Aware Rules |
| |
| 作者姓名： | Yun Wang Xingquan Zuo |
| |
| 作者单位： | the School of Computing Science;the School of Information Engineering;the Key Laboratory of Trustworthy Distributed Computing and Service（BUPT） |
| |
| 基金项目： | is with the School of Computing Science,Beijing University of Posts and Telecommunications,Beijing 100876,and also with the Key Laboratory of Trustworthy Distributed Computing and Service(BUPT),Ministry of Education,Beijing 100876,China(e-mail:zuoxq@bupt.edu.cn).supported in part by the National Natural Science Foundation of China(61874204,61663028,61703199);the Science and Technology Plan Project of Jiangxi Provincial Education Department(GJJ190959)。 |
| |
| 摘 要： | Workflow scheduling is a key issue and remains a challenging problem in cloud computing.Faced with the large number of virtual machine(VM)types offered by cloud providers,cloud users need to choose the most appropriate VM type for each task.Multiple task scheduling sequences exist in a workflow application.Different task scheduling sequences have a significant impact on the scheduling performance.It is not easy to determine the most appropriate set of VM types for tasks and the best task scheduling sequence.Besides,the idle time slots on VM instances should be used fully to increase resources'utilization and save the execution cost of a workflow.This paper considers these three aspects simultaneously and proposes a cloud workflow scheduling approach which combines particle swarm optimization(PSO)and idle time slot-aware rules,to minimize the execution cost of a workflow application under a deadline constraint.A new particle encoding is devised to represent the VM type required by each task and the scheduling sequence of tasks.An idle time slot-aware decoding procedure is proposed to decode a particle into a scheduling solution.To handle tasks'invalid priorities caused by the randomness of PSO,a repair method is used to repair those priorities to produce valid task scheduling sequences.The proposed approach is compared with state-of-the-art cloud workflow scheduling algorithms.Experiments show that the proposed approach outperforms the comparative algorithms in terms of both of the execution cost and the success rate in meeting the deadline.
|
| 关 键 词： | Cloud computing idle time slot particle swarm optimization task scheduling sequence workflow scheduling |
An Effective Cloud Workflow Scheduling Approach Combining PSO and Idle Time Slot-Aware Rules |
| |
| Authors: | Yun Wang Xingquan Zuo |
| |
| Abstract: | Workflow scheduling is a key issue and remains a challenging problem in cloud computing. Faced with the large number of virtual machine (VM) types offered by cloud providers, cloud users need to choose the most appropriate VM type for each task. Multiple task scheduling sequences exist in a workflow application. Different task scheduling sequences have a significant impact on the scheduling performance. It is not easy to determine the most appropriate set of VM types for tasks and the best task scheduling sequence. Besides, the idle time slots on VM instances should be used fully to increase resources’ utilization and save the execution cost of a workflow. This paper considers these three aspects simultaneously and proposes a cloud workflow scheduling approach which combines particle swarm optimization (PSO) and idle time slot-aware rules, to minimize the execution cost of a workflow application under a deadline constraint. A new particle encoding is devised to represent the VM type required by each task and the scheduling sequence of tasks. An idle time slot-aware decoding procedure is proposed to decode a particle into a scheduling solution. To handle tasks’ invalid priorities caused by the randomness of PSO, a repair method is used to repair those priorities to produce valid task scheduling sequences. The proposed approach is compared with state-of-the-art cloud workflow scheduling algorithms. Experiments show that the proposed approach outperforms the comparative algorithms in terms of both of the execution cost and the success rate in meeting the deadline. |
| |
| Keywords: | Cloud computing idle time slot particle swarm optimization task scheduling sequence workflow scheduling |
| 本文献已被 维普 等数据库收录！ |
| 点击此处可从《》浏览原始摘要信息 |
|
点击此处可从《》下载全文 |
