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).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
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)
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)
Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1), 3 (2007)
Irani, S., Pruhs, K.R.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005)
Pruhs, K.: Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev. 34(4), 52–58 (2007)
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)
Author information
Authors and Affiliations
Corresponding author
Additional information
D.P. Bunde was supported in part by Howard Hughes Medical Institute grant 52005130.
This work was done when H.-L. Chan was a postdoc in University of Pittsburgh.
K. Pruhs was supported in part by NSF grants CNS-0325353, CCF-0514058, IIS-0534531, and CCF-0830558, and an IBM Faculty Award.
Rights and permissions
About this article
Cite this article
Bansal, N., Bunde, D.P., Chan, HL. et al. Average Rate Speed Scaling. Algorithmica 60, 877–889 (2011). https://doi.org/10.1007/s00453-009-9379-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-009-9379-z