A reformed task scheduling algorithm for heterogeneous distributed systems with energy consumption constraints

As the scale increases and performance improves, the energy consumption of high-performance computer systems is rapidly increasing. The energy-aware task scheduling for high-performance computer systems has become a hot spot for major supercomputing centers and data centers. In this paper, we study the task scheduling problem to minimize the schedule length of parallel applications while satisfying the energy constraints in heterogeneous distributed systems. The existing approaches mainly allocate unassigned tasks with minimal energy consumption which cannot achieve optimistic scheduling length in most cases. Based on this situation, we propose a reformed scheduling method with energy consumption constraint algorithm, which is based on an energy consumption level to pre-allocate energy consumption for unassigned tasks. The experimental results show that compared with the existing algorithms, our new algorithm can achieve better scheduling length under the energy consumption constraints.