arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1201.1695cs.DCcs.PF
收藏

基于DVF的能耗最小化中最优频率选择的一些观察

Some Observations on Optimal Frequency Selection in DVFS-based Energy Consumption Minimization

Nikzad Babaii Rizvandi, Javid Taheri, Albert Y. Zomaya

摘要:

近年来,并行和分布式计算系统的能耗问题引起了人们的广泛关注。响应于此,许多能量感知调度算法已经开发主要使用动态电压频率缩放(DVFS)的能力,已被纳入最近的商品处理器。这些算法大多涉及两个过程:调度生成和松弛回收。前一个通道涉及基于给定的成本函数(包括完工时间和能耗)在支持DVF的处理器之间重新分配任务;而后一个通道通常通过以较低的处理器频率执行具有松弛的单个任务来实现。本文从另一个角度出发,提出了一种新的松弛回收算法。首先,提出了利用处理器频率组合的任务松弛回收问题。其次,证明了:(1)如果处理器的工作频率集是连续的,则总可以用一个频率来获得最优能量;(2)对于具有离散工作频率集的实际处理器,总可以用至多两个频率来获得最优能量;以及(3)当处理器能量消耗是频率的凸函数时,这两个频率是相邻的。第三,提出了一种新的算法,以找到最佳的频率组合,从而获得最佳的能量。所提出的算法进行了评估的基础上,从实验中获得的结果与三组不同的任务图:3000随机生成的任务图,和600任务图两个流行的应用程序(高斯-约旦和LU分解)。实验结果表明了该算法的优越性。

英文摘要:

In recent years, the issue of energy consumption in parallel and distributed computing systems has attracted a great deal of attention. In response to this, many energy-aware scheduling algorithms have been developed primarily using the dynamic voltage-frequency scaling (DVFS) capability which has been incorporated into recent commodity processors. Majority of these algorithms involve two passes: schedule generation and slack reclamation. The former pass involves the redistribution of tasks among DVFS-enabled processors based on a given cost function that includes makespan and energy consumption; and, while the latter pass is typically achieved by executing individual tasks with slacks at a lower processor frequency. In this paper, a new slack reclamation algorithm is proposed by approaching the energy reduction problem from a different angle. Firstly, the problem of task slack reclamation by using combinations of processors' frequencies is formulated. Secondly, several proofs are provided to show that (1) if the working frequency set of processor is assumed to be continues, the optimal energy will be always achieved by using only one frequency, (2) for real processors with a discrete set of working frequencies, the optimal energy is always achieved by using at most two frequencies, and (3) these two frequencies are adjacent/neighbouring when processor energy consumption is a convex function of frequency. Thirdly, a novel algorithm to find the best combination of frequencies to result the optimal energy is presented. The presented algorithm has been evaluated based on results obtained from experiments with three different sets of task graphs: 3000 randomly generated task graphs, and 600 task graphs for two popular applications (Gauss-Jordan and LU decomposition). The results show the superiority of the proposed algorithm in comparison with other techniques.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑