论文标题
改善在线动态电源管理问题的界限
Improving the Bounds of the Online Dynamic Power Management Problem
论文作者
论文摘要
我们调查了{\ em降低电力机制}，该机制决定何时在状态之间过渡，以至于总能耗以执行成本，闲置成本和切换成本为特征，从而最小化。与以前关于离线模型的大多数研究相反，我们专注于在线模型，其中一系列作业及其发行时间，执行时间和截止日期以在线方式到达。更确切地说，我们利用了不同的打开和关闭策略，并呈现3个上限，并进一步显示了由Chen等人引入的双光播种模型中的2.1的下限。在2014年[Stacs 2014：226-238]，两者都超过了目前的最佳成绩。
We investigate the {\em power-down mechanism} which decides when a machine transitions between states such that the total energy consumption, characterized by execution cost, idle cost and switching cost, is minimized. In contrast to most of the previous studies on the offline model, we focus on the online model in which a sequence of jobs with their release time, execution time and deadline, arrive in an online fashion. More precisely, we exploit a different switching on and off strategy and present an upper bound of 3, and further show a lower bound of 2.1, in a dual-machine model, introduced by Chen et al. in 2014 [STACS 2014: 226-238], both of which beat the currently best result.
