.png){kind=icon}
.png){kind=icon}
Return
A learning and evolution-based intelligence algorithm for multi-objective heterogeneous cloud scheduling optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2024.111366.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The multi-objective directed acyclic graph scheduling problem (MDAGSP) is prevalent in cloud scheduling systems, involving the selection, assignment, and execution of multiple tasks/jobs with complex coupling interdependencies. High-quality solutions can yield substantial economic benefits. However, prevailing methods face challenges in obtaining a set of superior solutions for MDAGSP, due to the multifaceted nature of its variables, objectives, constraints, and heterogeneity. Firstly, this paper formulates a three-objective MDAGSP that includes makespan, energy costs and revenue, to model cloud scheduling systems. Subsequently, we propose a composite algorithm consisting of a selection phase and an assignment phase to automatically generate an efficient scheduling policy for this model. During the selection phase, a graph convolutional neural network learns high-level features to extract complex dependencies between tasks. During the assignment phase, an adaptive evolutionary algorithm assigns tasks to the appropriate executors. Finally, a series of experiments are conducted to validate the model's accuracy and assess the algorithm's efficiency. Compared to heuristic approaches, the algorithm achieves at least a 20.1% makespan reduction and 3.17% revenue increase. Remarkably, the algorithm obtains at least an 8.86% reduction in energy costs over the eleven baselines. In conclusion, the proposed algorithm provides decision-makers with a global view of scheduling plan.
Keywords:
Multi-objective scheduling problem
Evolutionary algorithm
Policy network
Learning-based method
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W