An improved task scheduling algorithm based on potential games in cloud computing

Abstract

The task scheduling problem of Cloud computing was modeled as an potential game. The mapping problem of users' tasks to virtual machines was abstracted into a path selection problem in traffic network. Each task agent was viewed as a selfish participant, who competed with each other for virtual ma-chine. Considering the virtual machines' capacity, we proves the game is a po-tential game which exists at least one Nash equilibrium. The consistency of Nash equilibrium and the minimum value of potential function is proved. Fi-nally, two improved task scheduling algorithm based on potential game are proposed. By our algorithms, the system can reach to a stable state eventually. Meanwhile, the algorithms can guarantee that the system load balancing level is adaptive to the amount of users' task changing. © 2014 Springer International Publishing.