Skip to main content

Advertisement

SpringerLink
Log in

Energy-efficient scheduling: classification, bounds, and algorithms

  • Published:
Sādhanā Aims and scope Submit manuscript

Abstract

The problem of attaining energy efficiency in distributed systems is of importance, but a general, non-domain-specific theory of energy-minimal scheduling is far from developed. In this paper, we classify the problems of energy-minimal scheduling and present theoretical foundations of the same. We derive results concerning energy-minimal scheduling of independent jobs in a distributed system with functionally similar machines with different working and idle power ratings. The machines considered in our system can have identical as well as different speeds. If the jobs can be divided into arbitrary parts, we show that the minimum-energy schedule can be generated in linear time and give exact scheduling algorithms. For the cases where jobs are non-divisible, we prove that the scheduling problems are NP-hard and also give approximation algorithms for the same along with their bounds.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. See https://www.energystar.gov/ia/partners/prod_development/downloads/DataCenterRating_General.pdf.

References

  1. Pinedo M L 2012 Scheduling: theory, algorithms, and systems. Springer

    Book  MATH  Google Scholar 

  2. Pragati Agrawal and Shrisha Rao 2014 Energy-aware scheduling of distributed systems. IEEE Transactions on Automation Science and Engineering 11(4): 1163–1175

    Article  Google Scholar 

  3. Pinedo M L 2009 Planning and scheduling in manufacturing and services, 2nd ed. Springer

    Book  MATH  Google Scholar 

  4. Herrmann J W (Ed.) (2006) Handbook of production scheduling, International Series in Operations Research & Management Science, vol. 89. Springer, Berlin

    Google Scholar 

  5. Jacek Blazewicz, Klaus Ecker, Erwin Pesch, Günter Schmidt, and Weglarz J 2019 Handbook on scheduling. Springer

    Book  MATH  Google Scholar 

  6. Yun W and Manas S 1999 Scheduling fixed-priority tasks with preemption threshold. In: Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA ’99). Hong Kong, China, pp. 328–335

  7. Sonia Y, Rachid C, Hubert K, and Bertrand G 2013 Multi-objective approach for energy-aware workflow scheduling in cloud computing environments. Sci. World J..https://doi.org/10.1155/2013/350934

  8. Jia H, Christian B, Andreas R and Alois K 2011 Energy-aware task allocation for network-on-chip based heterogeneous multiprocessor systems. In: Proceedings of the 19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2011), Cyprus, pp. 447–454

  9. Hafiz Fahad Sheikh, Hengxing Tan, Ishfaq Ahmad, Sanjay Ranka, and Phanisekhar B V 2012 Energy- and performance-aware scheduling of tasks on parallel and distributed systems. Journal on Emerging Technologies in Computing Systems 8(4): 32:1–32:37

    Article  Google Scholar 

  10. Jiming Yao, Zhifeng Li, Yintao Li, Jie Bai, Jue Wang, and Peng Lin 2019 Cost-efficient tasks scheduling for smart grid communication network with edge computing system. In: Proceedings of the 2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC), IEEE, pp. 272–277

  11. Yuping Fan, Zhiling Lan, Paul Rich, Allcock W E, Papka M E, Brian Austin, and David Paul 2019 Scheduling beyond CPUs for HPC. In: Proceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing, pp. 97–108

  12. Johan Pouwelse, Koen Langendoen, and Henk Sips 2001 Energy priority scheduling for variable voltage processors. In: Proceedings of the International Symposium on Low-Power Electronics and Design, pp. 28–33

  13. Mario Bambagini, Marko Bertogna, Mauro Marinoni, and Giorgio Buttazzo 2013 An energy-aware algorithm exploiting limited preemptive scheduling under fixed priorities. In: Proceedings of the Eighth IEEE International Symposium on Industrial Embedded Systems (SIES 2013), pp. 3–12

  14. Zomaya A Y and Young Choon Lee (Eds.) 2012 Energy-efficient distributed computing systems. Wiley–IEEE Computer Society

  15. Jean-Marc Pierson (Ed.) Large-scale distributed systems and energy efficiency. In: Wiley Series on Parallel and Distributed Computing. John Wiley and Sons

  16. Sandy Irani and Pruhs K R 2005 Algorithmic problems in power management. ACM Sigact News 36(2): 63–76

    Article  Google Scholar 

  17. Susanne Albers 2009 Algorithms for energy saving. In: Efficient Algorithms. Springer, pp. 173–186

  18. Sandy Irani, Sandeep Shukla, and Rajesh Gupta 2007 Algorithms for power savings. ACM Transactions on Algorithms 3(4): 41

    Article  MathSciNet  MATH  Google Scholar 

  19. John Augustine, Sandy Irani, and Chaitanya Swamy 2004 Optimal power-down strategies. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, IEEE, pp. 530–539

  20. Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs 2009 Speed scaling with an arbitrary power function. In: Proceedings of the Twentieth annual ACM–SIAM Symposium on discrete algorithms, Society for Industrial and Applied Mathematics, pp. 693–701

  21. Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs 2013 Speed scaling with an arbitrary power function. ACM Transactions on Algorithms 9(2): 18

    Article  MathSciNet  MATH  Google Scholar 

  22. Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs 2007 Speed scaling to manage energy and temperature. Journal of the ACM 54(1): 3

    Article  MathSciNet  MATH  Google Scholar 

  23. Frances Yao, Alan Demers, and Scott Shenker 1995 A scheduling model for reduced CPU energy. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, IEEE, pp. 374–382

  24. Arunarani A R, Manjula D, and Vijayan Sugumaran 2019 Task scheduling techniques in cloud computing: a literature survey. Future Generation Computer Systems 91: 407–415

    Article  Google Scholar 

  25. Fredy Juarez, Jorge Ejarque, and Badia R M 2018 Dynamic energy-aware scheduling for parallel task-based application in cloud computing. Future Generation Computer Systems 78: 257–271

    Article  Google Scholar 

  26. Lin Gu, Jingjing Cai, Deze Zeng, Yu Zhang, Hai Jin, and Weiqi Dai 2019 Energy efficient task allocation and energy scheduling in green energy powered edge computing. Future Generation Computer Systems 95: 89–99

    Article  Google Scholar 

  27. Bharadwaj Veeravalli, Debasish Ghose, and Robertazzi T G 2003 Divisible load theory: a new paradigm for load scheduling in distributed systems. Cluster Computing 6(1): 7–17

    Article  Google Scholar 

  28. Dantong Yu and Robertazzi T G 2003 Divisible load scheduling for grid computing. In: Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems, vol. 1, pp. 1–6

    Google Scholar 

  29. Ashish Kumar Singh and Sandeep Sahu 2014 Environment conscious public cloud scheduling algorithm with load balancing. International Journal of Computer Applications 87(13): 24–27

    Google Scholar 

  30. Monir Abdullah and Mohamed Othman 2013 Cost-based multi-QoS job scheduling using divisible load theory in cloud computing. Procedia Computer Science 18: 928–935

    Article  Google Scholar 

  31. Robertazzi T G, Moges M A, and Dantong Yu 2005 Divisible load scheduling with multiple sources: closed form solutions. In: Proceedings of the Conference on Information Sciences and Systems, March 2005

  32. Haiyan Shi, Wanliang Wang, and Ngaiming Kwok 2012 Energy dependent divisible load theory for wireless sensor network workload allocation. Mathematical Problems in Engineering https://doi.org/10.1155/2012.235289

    Article  Google Scholar 

  33. Leung J Y T, Kangbok Lee, and Pinedo M L 2012 Bi-criteria scheduling with machine assignment costs. International Journal of Production Economics 139(1): 321–329

    Article  Google Scholar 

  34. Kangbok Lee, Leung J Y T, Zhao-hong Jia, Wenhua Li, Pinedo M L, and Lin B M T 2014 Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. European Journal of Operational Research 238(1): 54–64

    Article  MathSciNet  MATH  Google Scholar 

  35. Kangbok Lee, Leung J Y T, and Pinedo M L 2012 Coordination mechanisms for parallel machine scheduling. European Journal of Operational Research 220(2): 305–313

    Article  MathSciNet  MATH  Google Scholar 

  36. Maciej Drozdowski, Jedrzej Marszałkowski, and Jakub Marszałkowski 2014 Energy trade-offs analysis using equal-energy maps. Future Generation Computer Systems 36: 311–321

    Article  Google Scholar 

  37. Feng Li, Warren Liao T, Wentong Cai and Lin Zhang 2020 Multitask scheduling in consideration of fuzzy uncertainty of multiple criteria in service-oriented manufacturing. IEEE Transactions on Fuzzy Systems 28(11): 2759–2771

    Article  Google Scholar 

  38. Etienne Le Sueur and Gernot Heiser 2010 Dynamic voltage and frequency scaling: the laws of diminishing returns. In: HotPower’10: Proceedings of the 2010 International Conference on Power Aware Computing and Systems, Vancouver, Canada

  39. Asfa Toor, Saif ul Islam, Nimra Sohail, Adnan Akhunzada, Jalil Boudjadar, Hasan Ali Khattak, Ikram Ud Din, and Rodrigues JJPC 2019 Energy and performance aware fog computing: a case of DVFS and green renewable energy. Future Generation Computer Systems 101: 1112–1121

    Article  Google Scholar 

  40. Stavrinides G L and Karatza H D 2019 An energy-efficient, QoS-aware and cost-effective scheduling approach for real-time workflow applications in cloud computing systems utilizing DVFS and approximate computations. Future Generation Computer Systems 96: 216–226

    Article  Google Scholar 

  41. David Halliday, Robert Resnick, and Jearl Walker 2010 Fundamentals of physics extended, vol. 1 Wiley

    MATH  Google Scholar 

  42. Pragati Agrawal and Shrisha Rao 2015 Energy-minimal scheduling of divisible loads. In: Proceedings of the Fourth International Workshop on Energy-Efficient Data Centres (E2DC 2015), co-located with ACM E-Energy 2015

  43. Johnson D S 1973 Approximation algorithms for combinatorial problems. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, ACM, pp. 38–49

  44. Graham R L 1969 Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17(2): 416–429

    Article  MathSciNet  MATH  Google Scholar 

  45. Teofilo Gonzalez, Ibarra O H, and Sartaj Sahni 1977 Bounds for LPT schedules on uniform processors. SIAM Journal on Computing 6(1): 155–166

    Article  MathSciNet  MATH  Google Scholar 

  46. Annamária Kovács 2010 New approximation bounds for LPT scheduling. Algorithmica 57(2): 413–433

    Article  MathSciNet  MATH  Google Scholar 

  47. Victor Avelar, Dan Azevedo, and Alan French 2012 PUE: a comprehensive examination of the metric. White Paper #49, The Green Grid, October 2012

  48. Brady G A, Nikil Kapur, Summers J L, and Thompson H M 2013 A case study and critical assessment in calculating power usage effectiveness for a data centre. Energy Conversion and Management 76: 155–161

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Maulana Azad National Institute of Technology, Bhopal, India

    Pragati Agrawal

  2. International Institute of Information Technology Bangalore, Bangalore, India

    Shrisha Rao

Authors
  1. Pragati Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shrisha Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pragati Agrawal.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Agrawal, P., Rao, S. Energy-efficient scheduling: classification, bounds, and algorithms. Sādhanā 46, 46 (2021). https://doi.org/10.1007/s12046-021-01564-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12046-021-01564-w

Keywords

Search

Navigation