Document Open Access Logo

A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling

Authors Mitra Nasri, Geoffrey Nelissen, Björn B. Brandenburg

PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2018.9.pdf
  • Filesize: 1.94 MB
  • 23 pages

Document Identifiers

Author Details

Mitra Nasri
  • Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany
Geoffrey Nelissen
  • CISTER Research Centre, Polytechnic Institute of Porto (ISEP-IPP), Porto, Portugal
Björn B. Brandenburg
  • Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany

Cite AsGet BibTex

Mitra Nasri, Geoffrey Nelissen, and Björn B. Brandenburg. A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling. In 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 106, pp. 9:1-9:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ECRTS.2018.9

Abstract

An effective way to increase the timing predictability of multicore platforms is to use non-preemptive scheduling. It reduces preemption and job migration overheads, avoids intra-core cache interference, and improves the accuracy of worst-case execution time (WCET) estimates. However, existing schedulability tests for global non-preemptive multiprocessor scheduling are pessimistic, especially when applied to periodic workloads. This paper reduces this pessimism by introducing a new type of sufficient schedulability analysis that is based on an exploration of the space of possible schedules using concise abstractions and state-pruning techniques. Specifically, we analyze the schedulability of non-preemptive job sets (with bounded release jitter and execution time variation) scheduled by a global job-level fixed-priority (JLFP) scheduling algorithm upon an identical multicore platform. The analysis yields a lower bound on the best-case response-time (BCRT) and an upper bound on the worst-case response time (WCRT) of the jobs. In an empirical evaluation with randomly generated workloads, we show that the method scales to 30 tasks, a hundred thousand jobs (per hyperperiod), and up to 9 cores.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Software and its engineering → Real-time schedulability
Keywords
  • global multiprocessor scheduling
  • schedulability analysis
  • non-preemptive tasks
  • worst-case response time
  • best-case response time

Metrics

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

Related Versions

References

  1. Ahmed Alhammad and Rodolfo Pellizzoni. Schedulability analysis of global memory-predictable scheduling. In ACM International Conference on Embedded Software, pages 20:1-20:10, 2014. Google Scholar
  2. Neil Audsley, Alan Burns, Mike Richardson, Ken Tindell, and Andy J. Wellings. Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal, 8(5):284-292, 1993. Google Scholar
  3. 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 (OPODIS), pages 62-75. Springer, 2007. Google Scholar
  4. Sanjoy Baruah and Alan Burns. Sustainable scheduling analysis. In IEEE Real-Time Systems Symposium (RTSS), pages 159-168, 2006. Google Scholar
  5. Vincenzo Bonifaci and Alberto Marchetti-Spaccamela. Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica, 63(4):763-780, 2012. Google Scholar
  6. Artem Burmyakov, Enrico Bini, and Eduardo Tovar. An exact schedulability test for global FP using state space pruning. In International Conference on Real-Time Networks and Systems (RTNS), 2015. Google Scholar
  7. Anton Cervin, Bo Lincoln, Karl-Erik Arzen, and Giorgio Buttazzo. The Jitter Margin and Its Application in the Design of Real-Time Control Systems. In International Conference on Real-Time and Embedded Computing Systems and Applications (RTCSA), pages 1-9, 2004. Google Scholar
  8. Paul Emberson, Roger Stafford, and Robert I. Davis. Techniques For The Synthesis Of Multiprocessor Tasksets. In International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS), pages 6-11, 2010. Google Scholar
  9. Nan Guan, Zonghua Gu, Qingxu Deng, Shuaihong Gao, and Ge Yu. Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking. In Software Technologies for Embedded and Ubiquitous Systems (SEUS), pages 263-272, 2007. Google Scholar
  10. Nan Guan, Wang Yi, Qingxu Deng, Zonghua Gu, and Ge Yu. Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling. Journal of Systems Architecture, 57(5):536-546, 2011. Google Scholar
  11. Nan Guan, Wang Yi, Zonghua Gu, Qingxu Deng, and Ge Yu. New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms. In IEEE Real-Time Systems Symposium (RTSS), pages 137-146, 2008. Google Scholar
  12. S. Kramer, D Ziegenbein, and A Hamann. Real world automotive benchmark for free. In International Workshop on Analysis Tools and Methodologies for Embedded Real-Time Systems (WATERS), 2015. Google Scholar
  13. Jinkyu Lee. Improved schedulability analysis using carry-in limitation for non-preemptive fixed-priority multiprocessor scheduling. IEEE Transactions on Computers, 66(10):1816-1823, 2017. Google Scholar
  14. Jinkyu Lee and Kang G. Shin. Improvement of real-time multi-coreschedulability with forced non-preemption. IEEE Transactions on Parallel and Distributed Systems, 25(5):1233-1243, 2014. Google Scholar
  15. Cláudio Maia, Geoffrey Nelissen, Luis Nogueira, Luis Miguel Pinho, and Daniel Gracia Pérez. Schedulability analysis for global fixed-priority scheduling of the 3-phase task model. In IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 1-10, 2017. Google Scholar
  16. Mitra Nasri and Björn B. Brandenburg. An exact and sustainable analysis of non-preemptive scheduling. In IEEE Real-Time Systems Symposium (RTSS), pages 1-12, 2017. Google Scholar
  17. Mitra Nasri and Gerhard Fohler. Non-work-conserving non-preemptive scheduling: motivations, challenges, and potential solutions. In Euromicro Conference on Real-Time Systems (ECRTS), pages 165-175, 2016. Google Scholar
  18. Mitra Nasri and Mehdi Kargahi. Precautious-RM: a predictable non-preemptive scheduling algorithm for harmonic tasks. Real-Time Systems, 50(4):548-584, 2014. Google Scholar
  19. Mitra Nasri, Geoffrey Nelissen, and Björn B. Brandenburg. A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling. Technical Report MPI-SWS-2018-003, Max Planck Institute for Software Systems, Germany, 2018. URL: http://www.mpi-sws.org/tr/2018-003.pdf.
  20. Rodolfo Pellizzoni, Emiliano Betti, Stanley Bak, Gang Yao, John Criswell, Marco Caccamo, and Russell Kegley. A predictable execution model for COTS-based embedded systems. In IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 269-279, 2011. Google Scholar
  21. Abusayeed Saifullah, David Ferry, Jing Li, Kunal Agrawal, Chenyang Lu, and Christopher D. Gill. Parallel real-time scheduling of DAGs. IEEE Transactions on Parallel and Distributed Systems, 25(12):3242-3252, 2014. Google Scholar
  22. Roger Stafford. Random vectors with fixed sum. Technical report, University of Oxford, 2006. URL: http://www.mathworks.com/matlabcentral/fileexchange/9700.
  23. Youcheng Sun and Giuseppe Lipari. A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling. Real-Time Syst., 52(3):323-355, 2016. Google Scholar
  24. Rohan Tabish, Renato Mancuso, Saud Wasly, Ahmed Alhammad, Sujit S Phatak, Rodolfo Pellizzoni, and Marco Caccamo. A real-time scratchpad-centric OS for multi-core embedded systems. In IEEE Conference on Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 1-11, 2016. Google Scholar
  25. Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter Puschner, Jan Staschulat, and Per Stenström. The worst-case execution-time problem - overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems, 7(3):36:1-36:53, 2008. Google Scholar
  26. Jun Xiao, Sebastian Altmeyer, and Andy Pimentel. Schedulability analysis of non-preemptive real-time scheduling for multicore processors with shared caches. In IEEE Real-Time Systems Symposium (RTSS), 2017. 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