An Efficient Scheduling Algorithm for Energy Consumption Constrained Parallel Applications on Heterogeneous Distributed Systems

As the explosive growth of energy consumption in current heterogeneous distributed systems, energy consumption constraint has been one of the primary design issues. Minimizing the schedule length while satisfying the energy consumption constraint of parallel applications is one of the most important problem which has been studied recently. Previous studies have proposed a preassignment approach which tried to presuppose the minimum energy consumption assignment for unassigned tasks to solve the problem based on the dynamic voltage and frequency scaling (DVFS) technique. However, the preassignment of unassigned tasks with the minimum energy consumption does not necessarily lead to the minimization of the schedule length. In this study, we propose an efficient scheduling algorithm using a relative average assignments for tasks. The results of experiments on two real parallel applications validate that the proposed algorithm can obtain shorter schedule length while satisfying the energy consumption constraint compared with the state-ofthe-art methods in various situations.