Scheduling energy-constrained parallel applications in heterogeneous systems

With the rapid development of information technology, efficient energy utilization has become a major challenge in modern computing system design. This paper focuses on the energy-constrained parallel application scheduling problem in heterogeneous systems and proposes three algorithms to minimize the makespan of applications. The first one is the minimum makespan algorithm under energy constraints. In this algorithm, we construct an optimal cost table with energy constraints, which can be applied to determine the priority of tasks and the processors allocated in the application. The second one is the energy reclaiming algorithm, which is used to reclaim some energy from non-critical tasks while ensuring that the makespan of the application remains unchanged. The third one is the energy reallocation algorithm, which tends to allocate reclaimed energy to critical tasks to increase their execution frequency, thereby reducing the makespan of the entire application. Experiments were conducted on different parallel applications in various scenarios, and the results showed that the proposed algorithm can achieve smaller makespan compared to existing algorithms in most cases.