Abstract
Minimizing the schedule length of parallel applications, which run on a heterogeneous multi-core system and are subject to energy consumption constraints, has recently attracted much attention. The key point of this problem is the strategy to pre-allocate the energy consumption of unscheduled tasks. Previous articles used the minimum value, average value or a power consumption weight value as the pre-allocation energy consumption of tasks. However, they all ignored the different levels of tasks. The tasks in different task levels have different impact on the overall schedule length when they are allocated the same energy consumption. Considering the task levels, we designed a novel task energy consumption pre-allocation strategy that is conducive to minimizing the scheduling time and developed a novel task schedule algorithm based on it. After getting the preliminary scheduling results, we also proposed a task execution frequency re-adjustment mechanism that can re-adjust the execution frequency of tasks, to further reduce the overall schedule length. We carried out a considerable number of experiments with practical parallel application models. The results of the experiments show that our method can reach better performance compared with the existing algorithms.
Highlights
Computer systems nowadays must perform much better than ever before, ensuring the simultaneous running of many applications
We propose a novel method to minimize the scheduling length of energyconstrained applications which run on a heterogeneous multi-core system
Our method mainly includes two parts: a novel task energy pre-allocation strategy and the schedule algorithm based on it; a re-adjustment mechanism of task execution frequency after preliminary scheduling
Summary
Computer systems nowadays must perform much better than ever before, ensuring the simultaneous running of many applications. We study the following problem: minimizing the schedule length of energy consumption constrained parallel applications on heterogeneous multi-core systems. Xiao et al [20] came up with an algorithm called MSLECC (minimizing schedule length of energy consumption constrained) It takes the minimum energy consumption of a task as its pre-allocation energy consumption. High priority tasks take up too much energy consumption, so that low priority tasks can only be allocated to low-power processor cores and close to the lowest execution frequency due to the energy consumption constraint, which will lead to an increase in the overall schedule length.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have