A low-power task scheduling algorithm for heterogeneous cloud computing

Abstract

As a new type of computing, cloud computing has led to a major computational change. Among many technologies in cloud computing, task scheduling has always been studied as a core issue by industry and academia. In the existing research, the main goal is completion time or load balancing. However, as the expansion of cluster size, energy consumption becomes a problem that must be faced. In this paper, the first of maximum loss scheduling algorithm is proposed. The algorithm is a low-power algorithm that can greatly reduce the energy consumption of cloud computing clusters through loss comparison rule. The effect of this method is more obvious as the cluster size and the number of tasks increase. Experimental simulation results show that the proposed method is significantly better than the Max–Min, Min–Min, Sufferage and E-HEFT algorithms. Compared to Min–Min, Max–Min, Sufferage and E-HEFT algorithms, average completion time of the algorithm reduces 16%, 12%, 8% and 14%, respectively. At the same time, the load balancing effect is also better than Min–Min and Sufferage algorithms.