How to Schedule When You Have to Buy Your Energy
How to Schedule When You Have to Buy Your Energy
复制标题
如何安排何时需要购买能源
DOI：
10.1007/978-3-642-15369-3_27
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
C. Stein
中科院分区：
文献类型：
--
作者：
K. Pruhs;C. Stein
我们考虑一个情况，随着时间的推移，工作中心的工作中心由相同的速度估算处理器组成。对于每项工作，调度员知道收入损失了多少，这是由于延迟工作时间的函数。调度程序还知道一个能源单位的固定成本。在线调度程序确定要在哪些处理器上运行哪些作业，以及运行处理器的速度。调度程序的目标是最大化利润，即从工作中获得的收入减去了能源成本。我们给出了（1+e）-speed O（1） - 竞争算法，并表明资源增强对于实现O（1）竞争性是必要的。
We consider a situation where jobs arrive over time at a data center, consisting of identical speed-scalable processors. For each job, the scheduler knows how much income is lost as a function of how long the job is delayed. The scheduler also knows the fixed cost of a unit of energy. The online scheduler determines which jobs to run on which processors, and at what speed to run the processors. The scheduler's objective is to maximize profit, which is the income obtained from jobs minus the energy costs. We give a (1+e)-speed O(1)-competitive algorithm, and show that resource augmentation is necessary to achieve O(1)-competitiveness.