Abstract

In cloud computing, task scheduling and resource allocation are the two core issues of the IaaS layer. Efficient task scheduling algorithm can improve the matching efficiency between tasks and resources. In this paper, an enhanced heterogeneous earliest finish time based on rule (EHEFT-R) task scheduling algorithm is proposed to optimize task execution efficiency, quality of service (QoS) and energy consumption. In EHEFT-R, ordering rules based on priority constraints are used to optimize the quality of the initial solution, and the enhanced heterogeneous earliest finish time (HEFT) algorithm is used to ensure the global performance of the solution space. Simulation experiments verify the effectiveness and superiority of EHEFT-R.

Details

Title
EHEFT-R: multi-objective task scheduling scheme in cloud computing
Author
Zhang, Honglin 1 ; Wu, Yaohua 1 ; Sun, Zaixing 2 

 Shandong University, Faculty of Control Science and Engineering, Jinan, China (GRID:grid.27255.37) (ISNI:0000 0004 1761 1174) 
 Harbin Institute of Technology, School of Computer Science and Technology, Shenzhen, China (GRID:grid.19373.3f) (ISNI:0000 0001 0193 3564) 
Pages
4475-4482
Publication year
2022
Publication date
Dec 2022
Publisher
Springer Nature B.V.
ISSN
21994536
e-ISSN
21986053
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2729294006
Copyright
© The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.