Skip to main content
SpringerLink
Log in

Algorithms for Energy Management

(Invited Talk)

  • Conference paper
Computer Science – Theory and Applications (CSR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6072))

Included in the following conference series:

Abstract

This article surveys algorithmic techniques to save energy in computing environments. More specifically, we address power-down mechanisms as well as dynamic speed scaling in modern microprocessors. We study basic problems and present important results developed over the past years.

Work supported by a Gottfried Wilhelm Leibniz Award of the German Research Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.microsoft.com/whdc/system/pnppwr/ powermgmt/default.mspx

  2. Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms 3 (2007)

    Google Scholar 

  3. Augustine, J., Irani, S., Swamy, C.: Optimal power-down strategies. SIAM Journal on Computing 37, 1499–1516 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bansal, N., Bunde, D.P., Chan, H.-L., Pruhs, K.: Average rate speed scaling. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 240–251. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Bansal, N., Chan, H.-L., Lam, T.-W., Lee, K.-L.: Scheduling for speed bounded processors. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 409–420. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: Proc. 20th ACM-SIAM Symposium on Discrete Algorithm, pp. 693–701 (2009)

    Google Scholar 

  7. Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. Journal of the ACM 54 (2007)

    Google Scholar 

  8. Baruah, S.K., Koren, G., Mishra, B., Raghunathan, A., Rosier, L.E., Shasha, D.: On-line scheduling in the presence of overload. In: Proc. 32nd Annual Symposium on Foundations of Computer Science, pp. 100–110 (1991)

    Google Scholar 

  9. Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 805–813 (2007)

    Google Scholar 

  10. Bunde, D.P.: Power-aware scheduling for makespan and flow. In: Proc. 18th Annual ACM Symposiun on Parallel Algorithms and Architectures, pp. 190–196 (2006)

    Google Scholar 

  11. Chan, H.-L., Chan, W.-T., Lam, T.-W., Lee, K.-L., Mak, K.-S., Wong, P.W.H.: Energy efficient online deadline scheduling. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 795–804 (2007)

    Google Scholar 

  12. Irani, S., Karlin, A.R.: Online computation. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 521–564. PWS Publishing Company (1997)

    Google Scholar 

  13. Irani, S., Shukla, S.K., Gupta, R.K.: Online strategies for dynamic power management in systems with multiple power-saving states. ACM Transaction in Embedded Computing Systems 2, 325–346 (2003)

    Article  Google Scholar 

  14. Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.S.: Competitive randomized algorithms for nonuniform problems. Algorithmica 11, 542–571 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lam, T.-W., Lee, L.-K., To, I.K.-K., Wong, P.W.H.: Speed scaling functions for flow time scheduling based on active job count. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 647–659. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Li, M., Liu, B.J., Yao, F.F.: Min-energy voltage allocation for tree-structured tasks. Journal on Combintorial Optimization 11, 305–319 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  17. Li, M., Yao, F.F.: An efficient algorithm for computing optimal discrete voltage schedules. SIAM Journal on Computing 35, 658–671 (2005)

    Article  MathSciNet  Google Scholar 

  18. Li, M., Yao, A.C., Yao, F.F.: Discrete and continuous min-energy schedules for variable voltage processors. Proc. National Academy of Sciences USA 103, 3983–3987 (2006)

    Article  Google Scholar 

  19. Pruhs, K., van Stee, R., Uthaisombut, P.: Speed scaling of tasks with precedence constraints. Theory of Computing Systems 43, 67–80 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  20. Pruhs, K., Uthaisombut, P., Woeginger, G.J.: Getting the best response for your erg. ACM Transactions on Algorithms 4 (2008)

    Google Scholar 

  21. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communcations of the ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  22. Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: Proc. 36th IEEE Symposium on Foundations of Computer Science, pp. 374–382 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Humboldt University Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Susanne Albers

Authors
  1. Susanne Albers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Theoretical Cybernetics, Kazan State University, 420008, Kazan, Russia

    Farid Ablayev

  2. Institut für Informatik, Technische Universität München, 85748, Garching, Germany

    Ernst W. Mayr

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albers, S. (2010). Algorithms for Energy Management. In: Ablayev, F., Mayr, E.W. (eds) Computer Science – Theory and Applications. CSR 2010. Lecture Notes in Computer Science, vol 6072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13182-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13182-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13181-3

  • Online ISBN: 978-3-642-13182-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation