Cloud computing task scheduling algorithm based on dynamic priority
Ye Bo, Feng Li, Zhang Xiaoyu · 2022 IEEE 6th Information Technology and Mechatronics Engineering Conference (ITOEC) · 2022
In view of the large-scale and complex development trend of task scheduling in the current cloud computing environment, the traditional task priority scheduling algorithm is difficult to ensure the system load balance. A cloud computing task scheduling algorithm based on dynamic priority and scheduling decision is proposed(TS-DP). The algorithm calculates the task dynamic priority according to the task value and task urgency. At the same time, imitating the behavior of fireflies, the task scheduling decision variables are obtained by attraction (the user's expected earliest completion time), fluorescence brightness (task processing time constraint) and load balance, and then the tasks are scheduled to the executable computing node corresponding to the maximum decision variable value according to the task priority. Experimental results show that the algorithm can effectively improve the resource scheduling performance of cloud computing, shorten the completion time of the total task, and achieve good load balancing, especially when the number of tasks and the scale of nodes are large.