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

一种新的带睡眠状态的动态速度调节在线算法

New Online Algorithm for Dynamic Speed Scaling with Sleep State

Gunjan Kumar, Saswata Shannigrahi

摘要:

在本文中,我们考虑一个能量有效的调度问题,$n$作业$J_1, J_2, ..., J_n$需要执行,使这些作业的总能源使用量最小化,同时确保每个作业在它的截止日期内完成。我们在一个在线环境中工作,一个工作只有在它的到达时间,以及它的处理量和最后期限。在这样的设置中,Han等人的当前最著名的算法\cite{han}提供了能量使用的竞争比max $\{4, 2 + α^α\}$。在本文中,我们提出了一种新的在线算法SqOA,它提供了一个竞争比最大$\{4, 2 + (2-1/α)^α2^{α-1}\}$的能源使用。对于$α\geq 3$,我们的算法的竞争比优于任何其他现有的算法。

英文摘要:

In this paper, we consider an energy-efficient scheduling problem where $n$ jobs $J_1, J_2, ..., J_n$ need to be executed such that the total energy usage of these jobs is minimized while ensuring that each job is finished within it's deadline. We work in an online setting where a job is known only at it's arrival time, along with it's processing volume and deadline. In such a setting, the currently best-known algorithm by Han et al. \cite{han} provides a competitive ratio max $\{4, 2 + α^α\}$ of energy usage. In this paper, we present a new online algorithm SqOA which provides a competitive ratio max $\{4, 2 + (2-1/α)^α2^{α-1}\}$ of energy usage. For $α\geq 3$, the competitive ratio of our algorithm is better than that of any other existing algorithms for this problem.

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

↑