Deadline scheduling and power management for speed bounded processors

In this paper we consider online deadline scheduling on a processor that can manage its energy usage by scaling the speed dynamically or entering a sleep state. A new online scheduling algorithm called SOA is presented. Assuming speed can be scaled arbitrarily high (the infinite speed model), SOA can complete all jobs with reduced energy usage, improving the competitive ratio for energy from 2^2^@a^-^[email protected]^@a+2^@a^-^1+2 (Irani et al. (2007) [17]) to @a^@a+2, where @a is the constant involved in the speed-to-power function, commonly believed to be 2 or 3. More importantly, SOA is the first algorithm that works well even if the processor has a fixed maximum speed and the system is overloaded. In this case, SOA is 4-competitive for throughput and (@a^@[email protected]^24^@a+2)-competitive for energy. Note that the throughput ratio cannot be better than 4 even if energy is not a concern.

[1]  Kirk Pruhs,et al.  Nonclairvoyant Speed Scaling for Flow and Energy , 2009, STACS.

[2]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

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

[4]  BansalNikhil,et al.  Speed scaling to manage energy and temperature , 2007 .

[5]  Prudence W. H. Wong,et al.  Improved multi-processor scheduling for flow time and energy , 2012, J. Sched..

[6]  Prudence W. H. Wong,et al.  Competitive non-migratory scheduling for flow time and energy , 2008, SPAA '08.

[7]  Philip Levis,et al.  Policies for dynamic clock scheduling , 2000, OSDI.

[8]  Luca Benini,et al.  A survey of design techniques for system-level dynamic power management , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[9]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[10]  N. Bansal,et al.  Speed scaling with an arbitrary power function , 2009, SODA 2009.

[11]  Susanne Albers,et al.  Energy-efficient algorithms for flow time minimization , 2006, STACS.

[12]  Kirk Pruhs,et al.  Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule , 2009, ICALP.

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

[14]  John Augustine,et al.  Optimal power-down strategies , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[15]  Prudence W. H. Wong,et al.  Optimizing throughput and energy in online deadline scheduling , 2009, TALG.

[16]  Prudence W. H. Wong,et al.  Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count , 2008, ESA.

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

[18]  Prudence W. H. Wong,et al.  Sleep with Guilt and Work Faster to Minimize Flow Plus Energy , 2009, ICALP.

[19]  Sandy Irani,et al.  Online strategies for dynamic power management in systems with multiple power-saving states , 2003, TECS.

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

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

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

[23]  Prudence W. H. Wong,et al.  Energy efficient online deadline scheduling , 2007, SODA '07.

[24]  Kirk Pruhs,et al.  Proceedings of the eighteenth annual ACM-SIAM Symposium on discrete algorithms, SODA'07, New Orleans LA, USA, January 7-9, 2007 , 2007 .

[25]  Sanjoy K. Baruah,et al.  On-line scheduling in the presence of overload , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[27]  Nikhil Bansal,et al.  Scheduling for Speed Bounded Processors , 2008, ICALP.

[28]  Kang G. Shin,et al.  Real-time dynamic voltage scaling for low-power embedded operating systems , 2001, SOSP.