Power-aware scheduling for makespan and flow

We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give a linear-time algorithm to compute all non-dominated solutions for the general uniprocessor problem and a fast arbitrarily-good approximation for multiprocessor problems when every job requires the same amount of work. We also show that the multiprocessor problem becomes NP-hard when jobs can require different amounts of work.For total flow, we show that the optimal flow corresponding to a particular energy budget cannot be exactly computed on a machine supporting exact real arithmetic, including the extraction of roots. This hardness result holds even when scheduling equal-work jobs on a uniprocessor. We do, however, extend previous work by Pruhs et al. to give an arbitrarily-good approximation for scheduling equal-work jobs on a multiprocessor.

[1]  Kirk Pruhs,et al.  Getting the Best Response for Your Erg , 2004, SWAT.

[2]  Sandy Irani,et al.  Algorithmic problems in power management , 2005, SIGA.

[3]  Trevor N. Mudge,et al.  Power: A First-Class Architectural Design Constraint , 2001, Computer.

[4]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

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

[6]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[7]  Noga Alon,et al.  Approximation schemes for scheduling , 1997, SODA '97.

[8]  Scott Shenker,et al.  Scheduling for reduced CPU energy , 1994, OSDI '94.

[9]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[10]  Sharad Malik,et al.  Compile-time dynamic voltage scaling settings: opportunities and limits , 2003, PLDI '03.

[11]  Elif Uysal-Biyikoglu,et al.  Energy-efficient packet transmission over a wireless link , 2002, TNET.

[12]  Vitaly A. Strusevich,et al.  Single machine scheduling with controllable release and processing parameters , 2006, Discret. Appl. Math..

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

[14]  Kirk Pruhs,et al.  Speed scaling for weighted flow time , 2007, SODA '07.

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

[16]  W. Rudin.  Real and complex analysis , 1968 .

[17]  Dvir Shabtay,et al.  Parallel machine scheduling with a convex resource consumption function , 2006, Eur. J. Oper. Res..

[18]  Chandrajit L. Bajaj,et al.  The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..

[19]  W. Rudin.  Real and complex analysis, 3rd ed. , 1987 .

[20]  Vitaly A. Strusevich,et al.  Pre-Emptive Scheduling Problems with Controllable Processing Times , 2005, J. Sched..

[21]  T. V. Lakshman,et al.  Faster Algorithms for Minimum-Energy Scheduling of Wireless Data Transmissions , 2003 .

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

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

[24]  Elif Uysal-Biyikoglu,et al.  On adaptive transmission for energy efficiency in wireless data networks , 2004, IEEE Transactions on Information Theory.

[25]  Michael A. Bender,et al.  An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines , 2001, J. Algorithms.

[26]  Susanne Albers,et al.  Energy-Efficient Algorithms for Flow Time Minimization , 2006, STACS.

[27]  Vivek Tiwari,et al.  Reducing power in high-performance microprocessors , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[28]  Elif Uysal-Biyikoglu,et al.  Energy-efficient scheduling of packet transmissions over wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[30]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2006, SPAA '06.