.png){kind=icon}
.png){kind=icon}
Return
A gradient-based optimization approach for task scheduling problem in cloud computing
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-022-03580-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Task scheduling in cloud computing is a key component that affects the resource usage and operating costs of the system. In order to promote the efficiency of task executions in the cloud system, many heuristic algorithms and their variants have been used to optimize scheduling. Since makespan is the vital metric of cloud computing system, most of the relevant research focuses on improving this performance. The gradient-based optimization (GBO) has a faster convergence rate, and can avoid prematurely falling into the local optimum. In this work, we propose a task scheduling based on the GBO in the cloud to improve the makespan performance. Since the GBO is proposed for continuous optimization, rounding-off method is used to convert the real vector value of the GBO to the nearest integer value, thereby representing the solution of the task scheduling problem. To evaluate the performance of the proposed GBO-based scheduling method, two experimental cases are performed. The results of the two experimental cases show that compared with current heuristic algorithms, the GBO has better convergence speed and accuracy in searching for the optimal task scheduling solution, especially in the presence of large-scale tasks.
Keywords:
Task scheduling
Cloud computing
Virtual machines
Gradient-based optimization
Makespan
Journal
C
IF:
4.1
Papers:
5.0K
Citations:
7.5K