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.

中文翻译：

---

在异构系统中调度能耗受限的并行应用程序


随着信息技术的飞速发展，能源的高效利用已成为现代计算系统设计中的一大挑战。本文重点介绍异构系统中能量受限的并行应用程序调度问题，并提出了三种算法来最小化应用程序的构建跨度。第一个是能量约束下的最小 makespan 算法。在这个算法中，我们构建了一个具有能量约束的最优成本表，该表可用于确定任务的优先级和应用程序中分配的处理器。第二个是能量回收算法，用于从非关键任务中回收一些能量，同时确保应用程序的 makespan 保持不变。第三个是能量重新分配算法，它倾向于将回收的能量分配给关键任务，以提高其执行频率，从而减少整个应用程序的构建时间。在各种场景下对不同的并行应用进行了实验，结果表明，与现有算法相比，所提算法在大多数情况下可以实现更小的 makespan。