Advertisement

Algorithmica

, Volume 60, Issue 4, pp 877–889 | Cite as

Average Rate Speed Scaling

  • Nikhil Bansal
  • David P. Bunde
  • Ho-Leung Chan
  • Kirk Pruhs
Article

Abstract

Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dual-objective scheduling problems, where the operating system both wants to conserve energy and optimize some Quality of Service (QoS) measure of the resulting schedule. Yao, Demers, and Shenker (Proc. IEEE Symp. Foundations of Computer Science, pp. 374–382, 1995) considered the problem where the QoS constraint is deadline feasibility and the objective is to minimize the energy used. They proposed an online speed scaling algorithm Average Rate (AVR) that runs each job at a constant speed between its release and its deadline. They showed that the competitive ratio of AVR is at most (2α) α /2 if a processor running at speed s uses power s α . We show the competitive ratio of AVR is at least ((2−δ)α) α /2, where δ is a function of α that approaches zero as α approaches infinity. This shows that the competitive analysis of AVR by Yao, Demers, and Shenker is essentially tight, at least for large α. We also give an alternative proof that the competitive ratio of AVR is at most (2α) α /2 using a potential function argument. We believe that this analysis is significantly simpler and more elementary than the original analysis of AVR in Yao et al. (Proc. IEEE Symp. Foundations of Computer Science, pp. 374–382, 1995).

Speed scaling Voltage scaling Scheduling Online algorithms Power management 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albers, S., Müller, F., Schmelzer, S.: Speed scaling on parallel processors. In: Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 289–298 (2007) Google Scholar
  2. 2.
    Bansal, N., Chan, H.-L., Katz, D., Pruhs, K.: Improved bounds for speed scaling in devices obeying the cube-root rule. In: International Colloquium on Automata Languages and Programming, pp. 144–155 (2009) Google Scholar
  3. 3.
    Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1), 3 (2007) MathSciNetCrossRefGoogle Scholar
  4. 4.
    Irani, S., Pruhs, K.R.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005) CrossRefGoogle Scholar
  5. 5.
    Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev. 34(4), 52–58 (2007) CrossRefGoogle Scholar
  6. 6.
    Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proc. IEEE Symp. Foundations of Computer Science, pp. 374–382 (1995) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Nikhil Bansal
    • 1
  • David P. Bunde
    • 2
  • Ho-Leung Chan
    • 3
  • Kirk Pruhs
    • 4
  1. 1.IBM T.J. Watson Research CenterYorktown HeightsUSA
  2. 2.Computer Science DepartmentKnox CollegeGalesburgUSA
  3. 3.Department of Computer ScienceThe University of Hong KongHong KongChina
  4. 4.Computer Science DepartmentUniversity of PittsburghPittsburghUSA

Personalised recommendations