Cloud Computing Task Scheduling Method Based on a Coral Reefs Optimization Algorithm

Task scheduling is a difficult non-deterministic polynomial problem. Optimization of the scheduling algorithm is the key to improve the efficiency of cloud computing. The traditional meta-heuristic algorithm has slow convergence rate and is easy to fall into local optimal value. This paper proposes a new scheduling method based on a coral reefs algorithm. Firstly, the task scheduling model is formally described. The objective function is proposed to calculate load balancing rate, resource utilization and load balancing stability. Then the representation method of coral reef and the coding scheme of polyps are designed. Matrix random mapping method is applied to improve the variation effect of polyps. Finally, Ant Colony Optimization(ACO), the Genetic Algorithm(GA) andRound Robin(RR) algorithms are compared in terms of completion time, convergence effect and resource load. The simulation results show that the coral reef algorithm has reduced the completion time by 6.4%, 25.1%, 51.3%, and increased resource utilization by 10.0%, 15.2% and 51.3% when it is compared with the other three algorithms. It shows that the coral reef algorithm is suitable for task scheduling in the cloud environment.