Skip to main content
SpringerLink
Log in

An \(O(n^2)\) Algorithm for Computing Optimal Continuous Voltage Schedules

  • Conference paper
  • First Online:
Theory and Applications of Models of Computation (TAMC 2017)

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

Abstract

Dynamic Voltage Scaling techniques allow the processor to set its speed dynamically in order to reduce energy consumption. In the continuous model, the processor can run at any speed, while in the discrete model, the processor can only run at finite number of speeds given as input. The current best algorithm for computing the optimal schedules for the continuous model runs at \(O(n^2\log n)\) time for scheduling n jobs. In this paper, we improve the running time to \(O(n^2)\) by speeding up the calculation of s-schedules using a more refined data structure. For the discrete model, we improve the computation of the optimal schedule from the current best \(O(dn\log n)\) to \(O(n\log \max \{d,n\})\) where d is the number of allowed speeds.

The work described in this paper was fully supported by a grant from Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 117913).

H. Yuan—Part of this work was done while the author was working at City University of Hong Kong.

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 EPUB and 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

References

  1. Albers, S.: Energy-efficient algorithms. Commun. ACM 53(1), 86–96 (2010)

    Article  Google Scholar 

  2. Albers, S.: Algorithms for dynamic speed scaling. In: STACS 2011, pp. 1–11 (2011)

    Google Scholar 

  3. Albers, S., Antoniadis, A.: Race to idle: new algorithms for speed scaling with a sleep state. In: SODA 2012, pp. 1266–1285 (2012)

    Google Scholar 

  4. Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 534–544 (1998)

    Google Scholar 

  5. 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). doi:10.1007/978-3-540-78773-0_21

    Chapter  Google Scholar 

  6. Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: 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. LNCS, vol. 5125, pp. 409–420. Springer, Heidelberg (2008). doi:10.1007/978-3-540-70575-8_34

    Chapter  Google Scholar 

  7. Bansal, N., Kimbrel, T., Pruhs, K.: Dynamic speed scaling to manage energy and temperature. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 520–529 (2004)

    Google Scholar 

  8. Ben-Amram, A.M.: What is a “pointer machine”? SIGACT News 26(2), 88–95 (1995)

    Article  Google Scholar 

  9. Bunde, D.P.: Power-aware scheduling for makespan and flow. In: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 190–196 (2006)

    Google Scholar 

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

    Google Scholar 

  11. Chan, W.T., Lam, T.W., Mak, K.S., Wong, P.W.H.: Online deadline scheduling with bounded energy efficiency. In: Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation, pp. 416–427 (2007)

    Google Scholar 

  12. Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: STOC 1983: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 246–251. ACM, New York (1983)

    Google Scholar 

  13. Hong, I., Qu, G., Potkonjak, M., Srivastavas, M.B.: Synthesis techniques for low-power hard real-time systems on variable voltage processors. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 178–187 (1998)

    Google Scholar 

  14. Irani, S., Gupta, R.K., Shukla, S.: Algorithms for power savings. ACM Trans. Algorithms 3(4), 41:1–41:23 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Irani, S., Pruhs, K.: Algorithmic problems in power management. ACM SIGACT News 36(2), 63–76 (2005)

    Article  Google Scholar 

  16. Ishihara, T., Yasuura, H.: Voltage scheduling problem for dynamically variable voltage processors. In: Proceedings of International Symposium on Low Power Electronics and Design, pp. 197–202 (1998)

    Google Scholar 

  17. Kwon, W., Kim, T.: Optimal voltage allocation techniques for dynamically variable voltage processors. In: Proceedings of the 40th Conference on Design Automation, pp. 125–130 (2003)

    Google Scholar 

  18. Lam, T.-W., Lee, L.-K., To, I.K.K., Wong, P.W.H.: Energy efficient deadline scheduling in two processor systems. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 476–487. Springer, Heidelberg (2007). doi:10.1007/978-3-540-77120-3_42

    Chapter  Google Scholar 

  19. Li, M., Yao, F.F.: An efficient algorithm for computing optimal discrete voltage schedules. SIAM J. Comput. 35(3), 658–671 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Li, M., Liu, B.J., Yao, F.F.: Min-energy voltage allocation for tree-structured tasks. J. Comb. Optim. 11(3), 305–319 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  21. Li, M., Yao, A.C., Yao, F.F.: Discrete and continuous min-energy schedules for variable voltage processors. Proc. Nat. Acad. Sci. USA 103(11), 3983–3987 (2006)

    Article  Google Scholar 

  22. Pruhs, K., Stein, C.: How to schedule when you have to buy your energy. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX/RANDOM 2010. LNCS, vol. 6302, pp. 352–365. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15369-3_27

    Chapter  Google Scholar 

  23. Pruhs, K., Uthaisombut, P., Woeginger, G.: Getting the best response for your erg. In: Scandanavian Workshop on Algorithms and Theory, pp. 14–25 (2004)

    Google Scholar 

  24. Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215–225 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  25. Wu, W., Li, M., Chen, E.: Min-energy scheduling for aligned jobs in accelerate model. Theor. Comput. Sci. 412(12–14), 1122–1139 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  26. Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of the 36th Annual 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, City University of Hong Kong, Hong Kong SAR, Hong Kong

    Minming Li

  2. Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China

    Frances F. Yao

  3. Bopu Technologies, Shenzhen, China

    Hao Yuan

Authors
  1. Minming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frances F. Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hao Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Minming Li .

Editor information

Editors and Affiliations

  1. Anna University, Chennai, India

    T.V. Gopal

  2. Universität Bern , Bern, Switzerland

    Gerhard Jäger

  3. Universität Bern , Bern, Switzerland

    Silvia Steila

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Li, M., Yao, F.F., Yuan, H. (2017). An \(O(n^2)\) Algorithm for Computing Optimal Continuous Voltage Schedules. In: Gopal, T., Jäger , G., Steila, S. (eds) Theory and Applications of Models of Computation. TAMC 2017. Lecture Notes in Computer Science(), vol 10185. Springer, Cham. https://doi.org/10.1007/978-3-319-55911-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55911-7_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55910-0

  • Online ISBN: 978-3-319-55911-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation