arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.5995cs.DS
收藏

计算最优连续电压计划的$O(n^2)$算法

An $O(n^2)$ Algorithm for Computing Optimal Continuous Voltage Schedules

Minming Li, Frances F. Yao, Hao Yuan

摘要:

动态电压调节技术允许处理器动态设置其速度,以降低能耗。在连续模型中,处理器可以以任何速度运行,而在离散模型中,处理器只能以作为输入的有限数量的速度运行。目前计算连续模型最优调度的最佳算法是在$O(n^2\log n)$时间上运行,用于调度$n$作业。在本文中,我们提高了运行时间$O(n^2)$通过加快计算的s-时间表使用更精细的数据结构。对于离散模型,我们将最优调度的计算从当前最优的$O(dn\log n)$改进为$O(n\log \max\{d,n\})$,其中$d$是允许速度的数目。

英文摘要:

Dynamic Voltage Scaling techniques allow the processor to set its speed dynamically in order to reduce energy consumption. In the continuous model, the processor can run at any speed, while in the discrete model, the processor can only run at finite number of speeds given as input. The current best algorithm for computing the optimal schedules for the continuous model runs at $O(n^2\log n)$ time for scheduling $n$ jobs. In this paper, we improve the running time to $O(n^2)$ by speeding up the calculation of s-schedules using a more refined data structure. For the discrete model, we improve the computation of the optimal schedule from the current best $O(dn\log n)$ to $O(n\log \max\{d,n\})$ where $d$ is the number of allowed speeds.

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

↑