Multi-dimensional QoS Cloud Computing Task Scheduling Strategy Based on Improved Ant Colony Algorithm

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposed a multi-dimensional QoS cloud computing task scheduling algorithm based on improved ant colony algorithm, considering QoS demand of users and load balancing of cloud platform comprehensively. First, this paper defines a QoS model composed of the completion time and execution cost of tasks, and defines the cloud platform load balancing constraint function. Secondly, in view of the shortcomings of ant colony algorithm such as slow convergence speed and easy to fall into local optimum, the pheromone update method and expected heuristic function are improved, and the pheromone strength is dynamically changed. Finally, the simulation is carried out in cloudsim and compared with the ACS algorithm and the MMAS algorithm. Experimental results show that the algorithm in this paper is better than these two algorithms in terms of user satisfaction and cloud platform load.

Cite

CITATION STYLE

APA

Ge, J., Yu, D., & Fang, Y. (2021). Multi-dimensional QoS Cloud Computing Task Scheduling Strategy Based on Improved Ant Colony Algorithm. In Journal of Physics: Conference Series (Vol. 1848). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1848/1/012031

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free