Years and Authors of Summarized Original Work
-
1995; Yao, Demers, Shenker
Problem Definition
Speed scaling is a power management technique in modern processor that allows the processor to run at different speeds. There is a power function P(s) that specifies the power, which is energy used per unit of time, as a function of the speed. In CMOS-based processors, the cube-root rule states that \( { P(s) \approx s^3 } \). This is usually generalized to assume that \( { P(s)=s^{\alpha} } \) form some constant α. The goals of power management are to reduce temperature and/or to save energy. Energy is power integrated over time. Theoretical investigations to date have assumed that there is a fixed ambient temperature and that the processor cools according to Newton's law, that is, the rate of cooling is proportional to the temperature difference between the processor and the environment.
In the resulting scheduling problems, the scheduler must not only have a job‐selection policy to determine...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Albers S, Fujiwara H (2006) Energy-efficient algorithms for flow time minimization. In: STACS. Lecture notes in computer science, vol 3884. Springer, Berlin, pp 621–633
Bansal N, Kimbrel T, Pruhs K (2007) Speed scaling to manage energy and temperature. J ACM 54(1)
Bansal N, Pruhs K, Stein C (2007) Speed scaling for weighted flow. In: ACM/SIAM symposium on discrete algorithms
Pruhs K, Uthaisombut P, Woeginger G (2004) Getting the best response for your ERG. In: Scandanavian workshop on algorithms and theory
Yao F, Demers A, Shenker S (1995) A scheduling model for reduced CPU energy. In: IEEE symposium on foundations of computer science, p 374
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Pruhs, K. (2016). Speed Scaling. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_390
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_390
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering