Document Open Access Logo

Reachability-Based Response-Time Analysis of Preemptive Tasks Under Global Scheduling

Authors Pourya Gohari , Jeroen Voeten , Mitra Nasri

PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2024.3.pdf
  • Filesize: 6.59 MB
  • 24 pages

Document Identifiers

Author Details

Pourya Gohari
  • Eindhoven University of Technology (TU/e), The Netherlands
Jeroen Voeten
  • Eindhoven University of Technology (TU/e), The Netherlands
Mitra Nasri
  • Eindhoven University of Technology (TU/e), The Netherlands

Funding

This work used the Dutch national e-infrastructure with the support of the SURF Cooperative using grant no. EINF-8595 and the EU ECSEL Joint Undertaking under grant agreement no. 101007260 (project TRANSACT).

Cite AsGet BibTex

Pourya Gohari, Jeroen Voeten, and Mitra Nasri. Reachability-Based Response-Time Analysis of Preemptive Tasks Under Global Scheduling. In 36th Euromicro Conference on Real-Time Systems (ECRTS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 298, pp. 3:1-3:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ECRTS.2024.3

Abstract

Global scheduling reduces the average response times as it can use the available computing cores more efficiently for scheduling ready tasks. However, this flexibility poses challenges in accurately quantifying interference scenarios, often resulting in either conservative response-time analyses or scalability issues. In this paper, we present a new response-time analysis for preemptive periodic tasks (or job sets) subject to release jitter under global job-level fixed-priority (JLFP) scheduling. Our analysis relies on the notion of schedule-abstraction graph (SAG), a reachability-based response-time analysis known for its potential accuracy and efficiency. Up to this point, SAG was limited to non-preemptive tasks due to the complexity of handling preemption when the number of preemptions and the moments they occur are not known beforehand. In this paper, we introduce the concept of time partitions and demonstrate how it facilitates the extension of SAG for preemptive tasks. Moreover, our paper provides the first response-time analysis for the global EDF(k) policy - a JLFP scheduling policy introduced in 2003 to address the Dhall’s effect. Our experiments show that our analysis is significantly more accurate compared to the state-of-the-art analyses. For example, we identify 12 times more schedulable task sets than existing tests for the global EDF policy (e.g., for systems with 6 to 16 tasks, 70% utilization, and 4 cores) with an average runtime of 30 minutes. We show that EDF(k) outperforms global RM and EDF by scheduling on average 24.9% more task sets (e.g., for systems with 2 to 10 cores and 70% utilization). Moreover, for the first time, we show that global JLFP scheduling policies (particularly, global EDF(k)) are able to schedule task sets that are not schedulable using well-known partitioning heuristics.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Software and its engineering → Scheduling
Keywords
  • Response-time analysis
  • global scheduling
  • preemptive
  • job-level fixed-priority scheduling policy
  • multicore
  • schedule-abstraction graph

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Supplementary Materials

References

  1. Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, and Robert I Davis. An empirical survey-based study into industry practice in real-time systems. In Real-Time Systems Symposium (RTSS), pages 3-11, 2020. Google Scholar
  2. Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, and Robert I Davis. A comprehensive survey of industry practice in real-time systems. Real-Time Systems, 58(3):358-398, 2022. Google Scholar
  3. Björn Andersson, Sanjoy Baruah, and Jan Jonsson. Static-priority scheduling on multiprocessors. In Real-Time Systems Symposium (RTSS), pages 193-202, 2001. Google Scholar
  4. Neil Audsley, Alan Burns, Mike Richardson, Ken Tindell, and Andy J Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software engineering journal, 8(5):284-292, 1993. Google Scholar
  5. Theodore P Baker. Multiprocessor edf and deadline monotonic schedulability analysis. In Real-Time Systems Symposium (RTSS), pages 120-129, 2003. Google Scholar
  6. Theodore P Baker. An analysis of EDF schedulability on a multiprocessor. IEEE Transactions on Parallel and Distributed Systems, 16(8):760-768, 2005. Google Scholar
  7. Theodore P Baker and Michele Cirinei. Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks. In International Conference On Principles Of Distributed Systems, pages 62-75, 2007. Google Scholar
  8. Sanjoy Baruah. Techniques for multiprocessor global schedulability analysis. In Real-Time Systems Symposium (RTSS), pages 119-128, 2007. Google Scholar
  9. Sanjoy K Baruah, Aloysius K Mok, and Louis E Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Real-Time Systems Symposium (RTSS), pages 182-190, 1990. Google Scholar
  10. Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. Improved schedulability analysis of EDF on multiprocessor platforms. In Euromicro Conference on Real-Time Systems (ECRTS), pages 209-218, 2005. Google Scholar
  11. Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Transactions on parallel and distributed systems, 20(4):553-566, 2008. Google Scholar
  12. Enrico Bini and Giorgio C Buttazzo. Measuring the performance of schedulability tests. Real-time systems, 30(1-2):129-154, 2005. Google Scholar
  13. Alessandro Biondi and Youcheng Sun. On the ineffectiveness of 1/m-based interference bounds in the analysis of global edf and fifo scheduling. Real-Time Systems, 54:515-536, 2018. Google Scholar
  14. Vincenzo Bonifaci and Alberto Marchetti-Spaccamela. Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica, 63:763-780, 2012. Google Scholar
  15. Artem Burmyakov, Enrico Bini, and Chang-Gun Lee. Towards a tractable exact test for global multiprocessor fixed priority scheduling. IEEE Transactions on Computers, 71(11):2955-2967, 2022. Google Scholar
  16. Artem Burmyakov, Enrico Bini, and Eduardo Tovar. An exact schedulability test for global FP using state space pruning. In International Conference on Real Time and Networks Systems (RTNS), pages 225-234, 2015. Google Scholar
  17. Maxime Chéramy, Pierre-Emmanuel Hladik, and Anne-Marie Déplanche. 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), pages 37-42, 2014. Google Scholar
  18. Liliana Cucu-Grosjean and Joël Goossens. Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms. Journal of systems architecture, 57(5):561-569, 2011. Google Scholar
  19. Robert I Davis and Alan Burns. Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In Real-Time Systems Symposium (RTSS), pages 398-409, 2009. Google Scholar
  20. Paul Emberson, Roger Stafford, and Robert I Davis. Techniques for the synthesis of multiprocessor tasksets. In Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS), pages 6-11, 2010. Google Scholar
  21. Pourya Gohari, Mitra Nasri, and Jeroen Voeten. Data-age analysis for multi-rate task chains under timing uncertainty. In International Conference on Real-Time Networks and Systems (RTNS), pages 24-35, 2022. Google Scholar
  22. Pourya Gohari, Jeroen Voeten, and Mitra Nasri. Response-time analysis of fault-tolerant hard real-time systems under global scheduling. In International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 263-264, 2023. Google Scholar
  23. Pourya Gohari, Jeroen Voeten, and Mitra Nasri. Work-in-progress: Tight response-time analysis for periodic preemptive tasks under global scheduling. In Real-Time Systems Symposium (RTSS), pages 451-454, 2023. Google Scholar
  24. Joël Goossens, Shelby Funk, and Sanjoy Baruah. Priority-driven scheduling of periodic task systems on multiprocessors. Real-time systems, 25:187-205, 2003. Google Scholar
  25. Nan Guan, Zonghua Gu, Qingxu Deng, Shuaihong Gao, and Ge Yu. Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking. In IFIP International Workshop on Software Technologies for Embedded and Ubiquitous Systems, pages 263-272, 2007. Google Scholar
  26. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. New response time bounds for fixed priority multiprocessor scheduling. In Real-Time Systems Symposium (RTSS), pages 387-397, 2009. Google Scholar
  27. Rhan Ha and Jane WS Liu. Validating timing constraints in multiprocessor and distributed real-time systems. In International conference on distributed computing systems, pages 162-171, 1994. Google Scholar
  28. Simon Kramer, Dirk Ziegenbein, and Arne Hamann. Real world automotive benchmarks for free. In Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS), 2015. Google Scholar
  29. Jinkyu Lee and Insik Shin. Limited carry-in technique for real-time multi-core scheduling. Journal of Systems Architecture, 59(7):372-375, 2013. Google Scholar
  30. Mitra Nasri and Björn B Brandenburg. An exact and sustainable analysis of non-preemptive scheduling. In Real-Time Systems Symposium (RTSS), pages 12-23, 2017. Google Scholar
  31. Mitra Nasri, Geoffrey Nelissen, and Björn B Brandenburg. A response-time analysis for non-preemptive job sets under global scheduling. In Euromicro Conference on Real-Time Systems (ECRTS), pages 9-1, 2018. Google Scholar
  32. Mitra Nasri, Geoffrey Nelissen, and Björn B Brandenburg. Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling. In Euromicro Conference on Real-Time Systems (ECRTS), pages 21-1, 2019. Google Scholar
  33. Geoffrey Nelissen, Joan Marcè i Igual, and Mitra Nasri. Response-time analysis for non-preemptive periodic moldable gang tasks. In Euromicro Conference on Real-Time Systems (ECRTS), 2022. Google Scholar
  34. Suhail Nogd, Geoffrey Nelissen, Mitra Nasri, and Björn B Brandenburg. Response-time analysis for non-preemptive global scheduling with FIFO spin locks. In Real-Time Systems Symposium (RTSS), pages 115-127, 2020. Google Scholar
  35. Sayra Ranjha, Pourya Gohari, Geoffrey Nelissen, and Mitra Nasri. Partial-order reduction in reachability-based response-time analyses of limited-preemptive DAG tasks. Real-Time Systems, pages 1-55, 2023. Google Scholar
  36. Maria A Serrano, Alessandra Melani, Sebastian Kehr, Marko Bertogna, and Eduardo Quiñones. An analysis of lazy and eager limited preemption approaches under dag-based global fixed priority scheduling. In International Symposium on Real-Time Distributed Computing (ISORC), pages 193-202, 2017. Google Scholar
  37. Anand Srinivasan and Sanjoy Baruah. Deadline-based scheduling of periodic task systems on multiprocessors. Information processing letters, 84(2):93-98, 2002. Google Scholar
  38. Srinidhi Srinivasan, Geoffrey Nelissen, Reinder J. Bril, and Nirvana Meratnia. Analysis of tsn time-aware shapers using schedule abstraction graphs. In Euromicro Conference on Real-Time Systems (ECRTS), 2024. Google Scholar
  39. Youcheng Sun and Marco Di Natale. Assessing the pessimism of current multicore global fixed-priority schedulability analysis. In ACM Symposium on Applied Computing, pages 575-583, 2018. Google Scholar
  40. Youcheng Sun and Giuseppe Lipari. A weak simulation relation for real-time schedulability analysis of global fixed priority scheduling using linear hybrid automata. In International Conference on Real-Time Networks and Systems (RTNS), pages 35-44, 2014. Google Scholar
  41. Youcheng Sun and Giuseppe Lipari. Response time analysis with limited carry-in for global earliest deadline first scheduling. In IEEE Real-Time Systems Symposium, pages 130-140, 2015. Google Scholar
  42. Youcheng Sun and Giuseppe Lipari. A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling. Real-Time Systems, 52:323-355, 2016. Google Scholar
  43. Youcheng Sun, Giuseppe Lipari, Nan Guan, and Wang Yi. Improving the response time analysis of global fixed-priority multiprocessor scheduling. In International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 1-9, 2014. Google Scholar
  44. Beyazit Yalcinkaya, Mitra Nasri, and Björn B Brandenburg. An exact schedulability test for non-preemptive self-suspending real-time tasks. In Design, Automation & Test in Europe Conference & Exhibition (DATE), pages 1228-1233, 2019. Google Scholar
  45. Quan Zhou, Guohui Li, and Jianjun Li. Improved carry-in workload estimation for global multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems, 28(9):2527-2538, 2017. Google Scholar
  46. Quan Zhou, Guohui Li, Chunyang Zhou, and Jianjun Li. Limited busy periods in response time analysis for tasks under global edf scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 40(2):232-245, 2020. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact