Brief Announcement: A QPTAS for Non-preemptive Speed-scaling
Brief Announcement: A QPTAS for Non-preemptive Speed-scaling
复制标题
简短公告：用于非抢占式速度扩展的 QPTAS
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Maryam Shadloo
中科院分区：
文献类型：
--
作者：
Sungjin Im;Maryam Shadloo
现代处理器通常允许在经典模型中提供高吞吐量和能源效率的动态速度。 [1995年]研究了在第二次工作中完成所有工作的所有工作的问题，并提供了一个不错的多项式算法。扩展到各种设置。通常，禁止抢先一项工作，因为以前可能非常昂贵。对于任何固定的α> 1和ε> 0，即使只有一台机器，最大和最小的作业大小也具有对α的依赖性。 （1 +ε） - 在多个机器上对此问题的应用，该机器在NO（Polylog（n））时间内运行，其中n是要安排的作业数。
Modern processors typically allow dynamic speed-scaling offering an effective trade-off between high throughput and energy efficiency. In a classical model, a processor/machine runs at speed s when consuming power sα where α >1 is a constant. Yao et al. [FOCS 1995] studied the problem of completing all jobs before their deadlines on a single machine with the minimum energy in their seminal work and gave a nice polynomial time algorithm. The influential work has been extended to various settings. In particular, the problem has been extensively studied in the presence of multiple machines as multi-core processors have become dominant computing units. However, when jobs must be scheduled non-preemptively, our understanding of the problem remains fairly unsatisfactory. Often, preempting a job is prohibited since it could be very costly. Previously, a O((wmax wmin)α)-approximation was known for the non-preemptive setting where wmax and wmin denote the maximum and minimum job sizes, respectively. Even when there is only one machine, the best known approximation factor had a dependency on α. In this paper, for any fixed α >1 and ε >0, we give the first (1+ε)-approximation for this problem on multiple machines which runs in nO(polylog (n)) time where n is the number of jobs to be scheduled.
无抢占的速度扩展
DOI：
10.1007/978-3-319-13075-0_21
发表时间：
2014
期刊：
ArXiv
影响因子：
--
作者：
E. Bampis;D. Letsios;G. Lucarelli
通讯作者：
G. Lucarelli