Skip to main content
SpringerLink
Log in

Dynamic power management under the RUN scheduling algorithm: a slack filling approach

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Effective energy-aware scheduling is paramount for current and future multiprocessor real-time systems, being Dynamic Power Management (DPM) one of the employed techniques. In this paper we extend the Reduction to Uniprocessor (RUN) algorithm making it DPM-compliant. RUN is an optimal multiprocessor real-time scheduling for periodic implicit-deadline tasks and it is known to generate low overhead in terms of preemptions and migrations. It is based on an off-line reduction of the target multiprocessor system into one or more uniprocessor systems. On-line scheduling decisions for the latter is then efficiently translated back to the original system. The developed approach in this paper, called Dynamic Slack Filling (DSF-RUN), extends RUN in two aspects. First, the RUN reduction process is adapted to take into account slack entities, properly defined to represent processor spare capacity for DPM management. Second, on-line scheduling rules of RUN are modified so as to generate long time periods in the schedule by dynamically inserting slacks. Our approach has the same off-line complexity of the original RUN algorithm and takes either quadratic or linear on-line complexity in the number of tasks, depending on the strategy used to compute the maximum allowed idle periods. Results obtained with simulations show that our approach consumes less than 10% more energy than an idealized optimum DPM strategy.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. CPUs usually have ten or less clock frequencies available as operating points.

  2. Throughout this paper, we use the terms processor and cores interchangeably.

  3. We make this assumption for convenience only. The real-time scheduler considered in this paper (RUN) only needs to know the release instant of the first job of each task to work properly. A description of RUN is given in Sect. 4.

  4. http://projects.laas.fr/simso/.

References

  • Awan MA, Petters SM (2011) Enhanced race-to-halt: a leakage-aware energy management approach for dynamic priority systems. In: Euromicro Conference on Real-Time Systems, pp 92–101. IEEE

  • Awan MA, Petters SM (2013) Energy-aware partitioning of tasks onto a heterogeneous multi-core platform. In: Real-Time and Embedded Technology and Applications Symposium, pp 205–214. IEEE

  • Awan MA, Yomsi PM, Petters SM (2013) Optimal procrastination interval for constrained deadline sporadic tasks upon uniprocessors. In: International Conference on Real-Time Networks and Systems, pp 129–138. ACM, New York, NY, USA

  • Bambagini M, Aydin H (2014) Periodic charging scheme for fixed-priority real-time systems with renewable energy. In: International Symposium on Industrial Embedded Systems, pp 1–10

  • Bambagini M, Marinoni M, Aydin H, Buttazzo G (2016) Energy-aware scheduling for real-time systems: a survey. Trans Embed Comput Syst 15(1):7:1–7:34

    Google Scholar 

  • Baruah SK, Rosier LE, Howell RR (1990) Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst 2(4):301–324

    Article  Google Scholar 

  • Bhatia AK, Hazra M, Basu SK (2009) Better-fit heuristic for one-dimensional bin-packing problem. In: International Advance Computing Conference, pp 193–196. IEEE

  • Boudjadar J (2017) An efficient energy-driven scheduling of dvfs-multicore systems with a hierarchy of shared memories. In: International Symposium on Distributed Simulation and Real Time Applications, pp 1–8. IEEE

  • Chéramy M, Hladik PE, Déplanche AM (2014a) SimSo: a simulation tool to evaluate real-time multiprocessor scheduling algorithms. In: International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS). Madrid, Spain, p 6. https://hal.archives-ouvertes.fr/hal-01052651

  • Cheramy M, Hladik PE, Deplanche AM, Dube S (2014b) Simulation of real-time scheduling with various execution time models. In: Symposium on Industrial Embedded Systems, pp 1–4. IEEE

  • Chishiro H, Takasu M, Ueda R, Yamasaki N (2015) Optimal multiprocessor real-time scheduling based on run with voltage and frequency scaling. In: International Symposium on Real-Time Distributed Computing, pp 284–287

  • Compagnin D, Mezzetti E, Vardanega T (2014) Putting run into practice: implementation and evaluation. In: Euromicro Conference on Real-Time Systems, pp 75–84. IEEE Computer Society Press

  • Darwich M, Abdelgawad A, Bayoumi M (2016) A survey on the power and robustness of finfet SRAM. In: 2016 IEEE 59th International Midwest Symposium on Circuits and Systems (MWSCAS), pp 1–4. https://doi.org/10.1109/MWSCAS.2016.7869953

  • Davis R, Burns A (2011a) FPZL schedulability analysis. In: Real-Time and Embedded Technology and Applications Symposium, pp 245–256. IEEE

  • Davis R, Burns A (2011b) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43(4):1–44

    Article  Google Scholar 

  • DSouza S, Bhat A, Rajkumar R (2016) Sleep scheduling for energy-savings in multi-core processors. In: Euromicro Conference on Real-Time Systems, pp 226–236. IEEE

  • Emberson P, Stafford R, Davis R (2010) Techniques for the synthesis of multiprocessor tasksets. In: Workshop on analysis tools and methodologies for embedded and real-time systems, pp 6–11

  • Fu C, Calinescu G, Wang K, Li M, Xue CJ (2016) Energy-aware real-time task scheduling on local/shared memory systems. In: Real-Time Systems Symposium, pp 269–278. IEEE

  • Jejurikar R, Gupta R (2005) Dynamic slack reclamation with procrastination scheduling in real-time embedded systems. In: Design Automation Conference, pp 111–116

  • Kandhalu A, Kim J, Lakshmanan K, Rajkumar R (2011) Energy-aware partitioned fixed-priority scheduling for chip multi-processors. In: Conference on Embedded and Real-Time Computing Systems and Applications, vol 1, pp 93–102. IEEE

  • Khurram BM, Farooq M, Belleudy C, Auguin M (2009) Controlling energy profile of RT multiprocessor systems by anticipating workload at runtime. In: Symposium on new Machine Architectures

  • Lee YH, Reddy KP, Krishna CM (2003) Scheduling techniques for reducing leakage power in hard real-time systems. In: Euromicro Conference on Real-Time Systems, pp 105–112

  • Legout V, Jan M, Pautet L (2015) Scheduling algorithms to reduce the static energy consumption of real-time systems. Real-Time Syst 51:153–191

    Article  Google Scholar 

  • Lima G, Massa E, Regnier P (2019) Practical considerations in optimal multiprocessor scheduling. In: YC Tian, DC Levy (eds) Handbook of real-time computing, pp 1–39. Springer, Singapore. https://doi.org/10.1007/978-981-4585-87-3_3-1

  • Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46–61

    Article  MathSciNet  Google Scholar 

  • Massa E, Lima G, Regnier P (2014a) Revealing the secrets of run and QPS: New trends for optimal real-time multiprocessor scheduling. In: Brazilian Symposium on Computing Systems Engineering, pp 150–155. https://doi.org/10.1109/SBESC.2014.32

  • Massa E, Lima G, Regnier P, Levin G, Brandt S (2014b) Optimal and adaptive multiprocessor real-time scheduling: the quasi-partitioning approach. In: Proceedings of the 26th Euromicro Conference on Real-Time Systems (ECRTS 2014), pp 291–300. IEEE Computer Society. https://doi.org/10.1109/ECRTS.2014.19

  • McNaughton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6(1):1–12

    Article  MathSciNet  Google Scholar 

  • Meinhardt C, Zimpeck A, Reis R (2014) Predictive evaluation of electrical characteristics of sub-22nm finfet technologies under device geometry variations. Microelectron Reliab 54(9):2319–2324. https://doi.org/10.1016/j.microrel.2014.07.023

    Article  Google Scholar 

  • Nelissen G, Berten V, Goossens J, Milojevic D (2011) Reducing preemptions and migrations in real-time multiprocessor scheduling algorithms by releasing the fairness. In: 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, vol 1, pp 15–24. https://doi.org/10.1109/RTCSA.2011.57

  • Rawat A, Sharan N, Jang D, Chiarella T, Bufler FM, Catthoor F, Parvais B, Ganguly U (2021) Experimental validation of process-induced variability aware spice simulation platform for sub-20 nm finfet technologies. IEEE Trans Electron Dev. https://doi.org/10.1109/TED.2021.3053185

    Article  Google Scholar 

  • Regnier P, Lima G, Massa E, Levin G, Brandt S (2011) Run: optimal multiprocessor real-time scheduling via reduction to uniprocessor. In: Real-Time Systems Symposium, pp 104–115

  • Regnier P, Lima G, Massa E, Levin G, Brandt S (2013) Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach. Real-Time Syst 49(4):436–474

    Article  Google Scholar 

  • Rowe A, Lakshmanan K, Zhu H, Rajkumar R (2010) Rate-harmonized scheduling and its applicability to energy management. IEEE Trans Ind Inf 6(3):265–275

    Article  Google Scholar 

  • Tajalli, A.: Power-speed trade-offs in design of scaled fet circuits using c/ids methodology. IEEE Transactions on Circuits and Systems I: Regular Papers 68(2), 631–640 (2021). DOI: 10.1109/TCSI.2020.3036683

    Article  Google Scholar 

  • Xu H, Kong F, Deng Q (2012) Energy minimizing for parallel real-time tasks based on level-packing. In: International Conference on Embedded and Real-Time Computing Systems and Applications, pp 98–103. IEEE Computer Society

Download references

Acknowledgements

This work was partially supported by the Conselho Nacional de Desenvolvimento Científico e Tecnológico—Brasil (CNPq) and by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior—Brasil (CAPES)—Finance Code 001. George Lima was funded by Fundação de Amparo a Pesquisa do Estado da Bahia (FABESB) under Grant No. 0042/2016.

Author information

Authors and Affiliations

  1. Graduate Program in Computer Science (PPGCC), Federal University of Santa Catarina (UFSC), Florianópolis, Brazil

    Lais Borin, Márcio Castro & Patricia D. M. Plentz

  2. Graduate Programs in Computer Science and Mechatronics (PGCOMP and PPPGM), Federal University of Bahia (UFBA), Salvador, Brazil

    George Lima

Authors
  1. Lais Borin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Lima
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Márcio Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Patricia D. M. Plentz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Lima.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Borin, L., Lima, G., Castro, M. et al. Dynamic power management under the RUN scheduling algorithm: a slack filling approach. Real-Time Syst 57, 443–484 (2021). https://doi.org/10.1007/s11241-021-09367-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-021-09367-2

Keywords

Search

Navigation