Non-preemptive speed scaling

We consider the following variant of the speed scaling problem introduced by Yao, Demers, and Shenker. We are given a set of jobs and we have a variable-speed processor to process them. The higher the processor speed, the higher the energy consumption. Each job is associated with its own release time, deadline, and processing volume. The objective is to find a feasible schedule that minimizes the energy consumption. Moreover, no preemption of jobs is allowed. Unlike the preemptive version that is known to be in P, the non-preemptive version of speed scaling is strongly NP-hard. In this work, we present a constant factor approximation algorithm for it. The main technical idea is to transform the problem into the unrelated machine scheduling problem with Lp-norm objective.

[1]  Dan Tsafrir,et al.  Effects of clock resolution on the scheduling of interactive and soft real-time processes , 2003, SIGMETRICS '03.

[2]  Yossi Azar,et al.  Convex programming for scheduling unrelated parallel machines , 2005, STOC '05.

[3]  Sanjay Sharma,et al.  Measurement-based characterization of global memory and network contention, operating system and parallelization overheads , 1994, ISCA '94.

[4]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[5]  Tei-Wei Kuo,et al.  Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices , 2005, WADS.

[6]  Oliver Braun,et al.  Parallel Processor Scheduling with Limited Number of Preemptions , 2003, SIAM J. Comput..

[7]  Ravishankar K. Iyer,et al.  Performance degradation due to multiprogramming and system overheads in real workloads: case study on a shared memory multiprocessor , 1990, ICS '90.

[8]  Minming Li,et al.  An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules , 2005, SIAM J. Comput..

[9]  Manish Gupta,et al.  Power-Aware Microarchitecture: Design and Modeling Challenges for Next-Generation Microprocessors , 2000, IEEE Micro.

[10]  C. Natarajan,et al.  Measurement-based characterization of global memory and network contention, operating system and parallelisation overheads: case study on a shared-memory multiprocessor , 1994, Proceedings of 21 International Symposium on Computer Architecture.

[11]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12]  Minming Li,et al.  Min-energy voltage allocation for tree-structured tasks , 2005, J. Comb. Optim..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  René Sitters,et al.  On the Value of Preemption in Scheduling , 2006, APPROX-RANDOM.

[15]  Julia Chuzhoy,et al.  Resource Minimization Job Scheduling , 2009, APPROX-RANDOM.

[16]  Kirk Pruhs,et al.  Speed scaling to manage energy and temperature , 2007, JACM.