Abstract
Power-aware task scheduling on processors has been a research hotspot in computing systems. In this paper, we study the problem of minimizing the schedule length for energy consumption constrained parallel applications on heterogeneous computing systems. For this problem, existing work adopts a policy that preassigns the minimum energy consumption for each unassigned task. Nevertheless, our analysis reveals that, such a preassignment policy could be unfair for the low priority tasks, and it may not achieve an optimistic schedule length. Thereby, we propose a new task scheduling algorithm that suggests a weight-based mechanism to preassign energy consumption for unassigned tasks, and we provide the rigorous proof to show its feasibility. Further, we show that this idea can be extended to solve reliability maximization problems with energy consumption constraint or with both deadline and energy consumption constraints. We have conducted extensive experiments based on real parallel applications. The experimental results consistently demonstrate that our proposed algorithms can achieve favourable performance, compared to state-of-the-art algorithms.
Funding Information
  • National Key R&D Program of China (2018YFB0204100)
  • National Natural Science Foundation of China (61472124, 61472453, 61602166, 61702320, U1401256, U1501252, U1611264, U1711261, U1711262, U1811264, 61972425)

This publication has 52 references indexed in Scilit: