Algorithmica

, Volume 65, Issue 3, pp 605–633 | Cite as

Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy

  • Tak-Wah Lam
  • Lap-Kei Lee
  • Isaac K. K. To
  • Prudence W. H. Wong
Article
First Online:
Received:
Accepted:

Abstract

This paper is concerned with online scheduling algorithms that aim at minimizing the total flow time plus energy usage. The results are divided into two parts. First, we consider the well-studied “simple” speed scaling model and show how to analyze a speed scaling algorithm (called AJC) that changes speed discretely. This is in contrast to the previous algorithms which change the speed continuously. More interestingly, AJC admits a better competitive ratio, and without using extra speed. In the second part, we extend the study to a more general speed scaling model where the processor can enter a sleep state to further save energy. A new sleep management algorithm called IdleLonger is presented. This algorithm, when coupled with AJC, gives the first competitive algorithm for minimizing total flow time plus energy in the general model.

Keywords

Online algorithms Competitive analysis Scheduling Energy efficiency Dynamic speed scaling Sleep management Flow time 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms 3(4), 49 (2007) MathSciNetCrossRefGoogle Scholar
  2. 2.
    Augustine, J., Irani, S., Swamy, C.: Optimal power-down strategies. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), pp. 530–539 (2004) CrossRefGoogle Scholar
  3. 3.
    Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974) Google Scholar
  4. 4.
    Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 805–813 (2007) Google Scholar
  5. 5.
    Bansal, N., Chan, H.L., Lam, T.W., Lee, L.K.: Scheduling for speed bounded processors. In: Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pp. 409–420 (2008) CrossRefGoogle Scholar
  6. 6.
    Bansal, N., Chan, H.L., Pruhs, K.: Speed scaling with an arbitrary power function. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 693–701 (2009) Google Scholar
  7. 7.
    Benini, L., Bogliolo, A., de Micheli, G.: A survey of design techniques for system-level dynamic power management. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 8(3), 299–316 (2000) CrossRefGoogle Scholar
  8. 8.
    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) CrossRefGoogle Scholar
  9. 9.
    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 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 795–804 (2007) Google Scholar
  10. 10.
    Chan, H.L., Edmonds, J., Lam, T.W., Lee, L.K., Marchetti-Spaccamela, A., Pruhs, K.: Nonclairvoyant speed scaling for flow and energy. In: Proceedings of International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 255–264 (2009) Google Scholar
  11. 11.
    Gandhi, A., Gupta, V., Harchol-Balter, M., Kozuch, M.A.: Optimality analysis of energy-performance trade-off for server farm management. Perform. Eval. 67(11), 1155–1171 (2010) CrossRefGoogle Scholar
  12. 12.
    Greiner, G., Nonner, T., Souza, A.: The bell is ringing in speed-scaled multiprocessor scheduling. In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 11–18 (2009) Google Scholar
  13. 13.
    Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities. Cambridge University Press, Cambridge (1952) MATHGoogle Scholar
  14. 14.
    Irani, S., Pruhs, K.: Algorithmic problems in power management. ACM SIGACT News 32(2), 63–76 (2005) CrossRefGoogle Scholar
  15. 15.
    Irani, S., Shukla, S., Gupta, R.: Online strategies for dynamic power management in systems with multiple power-saving states. ACM Trans. Embed. Comput. Syst. 2(3), 325–346 (2003) CrossRefGoogle Scholar
  16. 16.
    Irani, S., Shukla, S., Gupta, R.K.: Algorithms for power savings. ACM Trans. Algorithms 3(4), 41 (2007) MathSciNetCrossRefGoogle Scholar
  17. 17.
    Karlin, A., Manasse, M., McGeoch, L., Owicki, S.: Competitive randomized algorithms for non-uniform problems. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 301–309 (1990) Google Scholar
  18. 18.
    Lam, T.W., Lee, L.K., To, I.K.K., Wong, P.W.H.: Competitive non-migratory scheduling for flow time and energy. In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 256–264 (2008) Google Scholar
  19. 19.
    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: Proceedings of European Symposium on Algorithms (ESA), pp. 647–659 (2008) Google Scholar
  20. 20.
    Mudge, T.: Power: a first-class architectural design constraint. Computer 34(4), 52–58 (2001) CrossRefGoogle Scholar
  21. 21.
    Schrage, L.: A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16(3), 687–690 (1968) MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), pp. 374–382 (1995) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Tak-Wah Lam
    • 1
  • Lap-Kei Lee
    • 2
  • Isaac K. K. To
    • 3
  • Prudence W. H. Wong
    • 3
  1. 1.Department of Computer ScienceUniversity of Hong KongHong KongChina
  2. 2.MADALGO (Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation), Department of Computer ScienceAarhus UniversityAarhusDenmark
  3. 3.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK

Personalised recommendations