Scheduling Algorithm for a Task under Cloud Computing

作者：Yao Yao · 发表于：International Journal of Performability Engineering · 年份：2019 · DOI：10.23940/ijpe.19.08.p7.20812090 · 被引用次数：1 · 研究领域：Cloud Computing and Resource Management、Distributed and Parallel Computing Systems

Aiming at the problem of low efficiency of task scheduling in cloud computing, this paper first analyzes the task of cloud computing task scheduling.Secondly, the pheromone setting quality function of the ant colony algorithm and the empirical feedback factor of selection probability are improved.The new method is adopted for the colonial calculation method and boundary value processing in the imperial competition algorithm.Finally, the two algorithms are merged to obtain a cloud computing task scheduling algorithm based on the ant colony algorithm-empire competition algorithm.In the simulation experiment, the algorithm demonstrates certain advantages in terms of task execution time, execution cost, and load rate.