Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem

We are given a set of jobs, each one specified by its release date, its deadline and its processing volume (work), and a single (or a set of) speed-scalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed s then the energy consumption is s^{\alpha} per time unit, where \alpha>1. Our goal is to find a schedule respecting the release dates and the deadlines of the jobs so that the total energy consumption is minimized. While most previous works have studied the preemptive case of the problem, where a job may be interrupted and resumed later, we focus on the non-preemptive case where once a job starts its execution, it has to continue until its completion without any interruption. We propose improved approximation algorithms for particular instances of the multiprocessor non-preemptive speed-scaling problem.

[1]  Susanne Albers,et al.  On multi-processor speed scaling with migration: extended abstract , 2011, SPAA '11.

[2]  Susanne Albers,et al.  Energy-efficient algorithms , 2010, Commun. ACM.

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

[4]  Kirk Pruhs,et al.  Speed Scaling of Tasks with Precedence Constraints , 2005, WAOA.

[5]  Susanne Albers,et al.  Speed scaling on parallel processors , 2007, SPAA.

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

[7]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2009, J. Sched..

[8]  Tei-Wei Kuo,et al.  Multiprocessor energy-efficient scheduling with task migration considerations , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

[9]  Evripidis Bampis,et al.  Speed scaling on parallel processors with migration , 2011, Euro-Par.

[10]  Kirk Pruhs,et al.  Speed Scaling of Tasks with Precedence Constraints , 2005, Theory of Computing Systems.

[11]  Mark R. Greenstreet,et al.  Energy Optimal Scheduling on Multiprocessors with Migration , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[12]  Alexander Souza,et al.  The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling , 2013, Theory of Computing Systems.

[13]  Antonios Antoniadis,et al.  Non-preemptive speed scaling , 2013, J. Sched..

[14]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).