Abstract
We consider speed scaling algorithms to minimize device temperature subject to the constraint that every task finishes by its deadline. We assume that the device cools according to Fourier’s law. We show that the optimal offline algorithm proposed in [18] for minimizing total energy (that we call YDS) is an O(1)-approximation with respect to temperature. Tangentially, we observe that the energy optimality of YDS is an elegant consequence of the well known KKT optimality conditions. Two online algorithms, AVR and Optimal Available, were proposed in [18] in the context of energy management. It was shown that these algorithms were O(1)-competitive with respect to energy in [18] and [2]. Here we show these algorithms are not O(1)-competitive with respect to temperature. This demonstratively illustrates the observation from practice that power management techniques that are effective for managing energy may not be effective for managing temperature. We show that the most intuitive temperature management algorithm, running at such a speed so that the temperature is constant, is surprisingly not O(1)-competitive with respect to temperature. In contrast, we show that the online algorithm BKP, proposed in [2], is O(1)-competitive with respect to temperature. This is the first O(1)-competitiveness analysis with respect to temperature for an online algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Augustine, J., Irani, S., Swamy, C.: Optimal power-down strategies. In: IEEE Symposium on Foundations of Computer Science (2004)
Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic speed scaling to manage energy and temperature. In: IEEE Symposium on Foundations of Computer Science (2004)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Brooks, D.M., Bose, P., Schuster, S.E., Jacobson, H., Kudva, P.N., Buyuktosunoglu, A., Wellman, J.-D., Zyuban, V., Gupta, M., Cook, P.W.: Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro 20(6), 26–44 (2000)
Buttazzo, G.: Hard Real-Time Computing Systems. Kluwer, Dordrecht (1997)
Gabriel, R.M.: An additional proof of a maximal theorem of hardy and littlewood. Journal of London Mathematical Society 6, 163–166 (1931)
Hardy, G.H.: Note on a theorem of hilbert. Math. Zeitschr. 6, 314–317 (1920)
Hardy, G.H., Littlewood, J.: A maximal theorem with function-theoretic applications. Acta Mathematica 54, 81–116 (1930)
Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities. Cambridge University Press, Cambridge (1952)
Irani, S., Gupta, R.K., Shukla, S.: Algorithms for Power Savings. In: ACM/SIAM Symposium on Discrete Algorithms (2003)
Irani, S., Shukla, S., Gupta, R.: Online strategies for dynamic power management in systems with multiple power saving states. Trans. on Embedded Computing Sys. (2003); Special Issue on Power Aware Embedded Computing
Mudge, T.: Power: A first-class architectural design constraint. Computer 34(4), 52–58 (2001)
Pruhs, K., Uthaisombut, P., Woeginger, G.: Getting the best response for your erg. In: Scandanavian Workshop on Algorithms and Theory (2004)
Sergent, J.E., Krum, A.: Thermal Management Handbook. McGraw-Hill, New York (1998)
Skadron, K., Stan, M.R., Huang, W., Velusamy, S., Sankaranarayanan, K., Tarjan, D.: Temperature-aware microarchitecture. In: International Symposium on Computer Architecture, pp. 2–13 (2003)
Tiwari, V., Singh, D., Rajgopal, S., Mehta, G., Patel, R., Baez, F.: Reducing power in high-performance microprocessors. In: Design Automation Conference, pp. 732–737 (1998)
http://www.usatoday.com/tech/news/2004-05-07-intel-kills-tejas_x.htm
Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced cpu energy. In: IEEE Symposium on Foundations of Computer Science, p. 374 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bansal, N., Pruhs, K. (2005). Speed Scaling to Manage Temperature. In: Diekert, V., Durand, B. (eds) STACS 2005. STACS 2005. Lecture Notes in Computer Science, vol 3404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31856-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-31856-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24998-6
Online ISBN: 978-3-540-31856-9
eBook Packages: Computer ScienceComputer Science (R0)