Document Open Access Logo

Analysis of EDF for Real-Time Multiprocessor Systems with Resource Sharing

Authors Kunal Agrawal , Sanjoy Baruah , Jeremy T. Fineman , Alberto Marchetti-Spaccamela , Jinhao Zhao

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ECRTS.2025.15.pdf
  • Filesize: 1.06 MB
  • 26 pages
HTML5 Logo HTML (experimental)
LIPIcs.ECRTS.2025.15.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
  • Mathematics of computing → Mathematical optimization
  • Computer systems organization → Real-time operating systems
Keywords
  • Real-Time Scheduling
  • Non-Clairvoyant Scheduling
  • EDF
  • Competitive Analysis
  • Shared Resources

Metrics

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

Abstract

The classic Earliest Deadline First (EDF) algorithm is widely studied and used due to its simplicity and strong theoretical performance, but has not been rigorously analyzed for systems where jobs may execute critical sections protected by shared locks. Analyzing such systems is often challenging due to unpredictable delays caused by contention. In this paper, we propose a straightforward generalization of EDF, called EDF-Block. In this generalization, the critical sections are executed non-preemptively, but scheduling and lock acquisition priorities are based on EDF. We establish lower bounds on the speed augmentation required for any non-clairvoyant scheduler (EDF-Block is an example of non-clairvoyant schedulers) and for EDF-Block, showing that EDF-Block requires at least 4.11× speed augmentation for jobs and 4× for tasks. We then provide an upper bound analysis, demonstrating that EDF-Block requires speedup of at most 6 to schedule all feasible job and task sets.

Cite As Get BibTex

Kunal Agrawal, Sanjoy Baruah, Jeremy T. Fineman, Alberto Marchetti-Spaccamela, and Jinhao Zhao. Analysis of EDF for Real-Time Multiprocessor Systems with Resource Sharing. In 37th Euromicro Conference on Real-Time Systems (ECRTS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 335, pp. 15:1-15:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ECRTS.2025.15

Author Details

Kunal Agrawal
  • Washington University in St. Louis, MO, USA
Sanjoy Baruah
  • Washington University in St. Louis, MO, USA
Jeremy T. Fineman
  • Georgetown University, Washington, D.C., USA
Alberto Marchetti-Spaccamela
  • University of Rome, Italy
Jinhao Zhao
  • Washington University in St. Louis, MO, USA

Funding

  • Agrawal, Kunal: NSF CCF-2106699, CCF-2107280, PPoSS-2216971.
  • Baruah, Sanjoy: NSF CNS-2141256, CPS-2229290.
  • Fineman, Jeremy T.: NSF CCF-2106759, CCF-1918989.

References

  1. Sebastian Altmeyer. A comparison between fixed priority and edf scheduling accounting for cache related pre-emption delays. LITES, 1, April 2014. URL: https://doi.org/10.4230/LITES-v001-i001-a001.
  2. S. Anand, Naveen Garg, and Nicole Megow. Meeting deadlines: How much speed suffices? In International Colloquium on Automata, Languages and Programming, 2011. URL: https://api.semanticscholar.org/CorpusID:16885010.
  3. Björn Andersson and Arvind Easwaran. Provably good multiprocessor scheduling with resource sharing. Real-Time Systems, 46:153-159, October 2010. URL: https://doi.org/10.1007/s11241-010-9105-6.
  4. Björn Andersson and Gurulingesh Raravi. Real-time scheduling with resource sharing on heterogeneous multiprocessors. Real - Time Systems, 50(2):270-314, March 2014. Real-Time Systems is a copyright of Springer, (2014). All Rights Reserved; 2023-12-03. URL: https://doi.org/10.1007/S11241-013-9195-Z.
  5. T.P. Baker. A stack-based resource allocation policy for realtime processes. In [1990] Proceedings 11th Real-Time Systems Symposium, pages 191-200, 1990. URL: https://doi.org/10.1109/REAL.1990.128747.
  6. Andre Berger, Arman Rouhani, and Marc Schroder. Fixed order scheduling with deadlines. arXiv preprint arXiv:2412.10760, 2024. Google Scholar
  7. Bjorn B. Brandenburg. Scheduling and locking in multiprocessor real-time operating systems. PhD thesis, The University of North Carolina at Chapel Hill, USA, 2011. AAI3502550. Google Scholar
  8. Björn B. Brandenburg. Multiprocessor real-time locking protocols: A systematic review. CoRR, abs/1909.09600, 2019. URL: https://arxiv.org/abs/1909.09600.
  9. Bjorn B. Brandenburg and James H. Anderson. Optimality results for multiprocessor real-time locking. In 2010 31st IEEE Real-Time Systems Symposium, pages 49-60, 2010. URL: https://doi.org/10.1109/RTSS.2010.17.
  10. Björn B. Brandenburg and James H. Anderson. The omlp family of optimal multiprocessor real-time locking protocols. Des. Autom. Embedded Syst., 17(2):277-342, June 2013. URL: https://doi.org/10.1007/s10617-012-9090-1.
  11. Björn B. Brandenburg. The fmlp+: An asymptotically optimal real-time locking protocol for suspension-aware analysis. In 2014 26th Euromicro Conference on Real-Time Systems, pages 61-71, 2014. URL: https://doi.org/10.1109/ECRTS.2014.26.
  12. Alan Burns and A.J. Wellings. A schedulability compatible multiprocessor resource sharing protocol - mrsp. In 2013 25th Euromicro Conference on Real-Time Systems, pages 282-291, July 2013. URL: https://doi.org/10.1109/ECRTS.2013.37.
  13. Chia-mei Chen and Satish Tripathi. Multiprocessor priority ceiling based protocols. Technical Report CS-TR-3252, March 2001. Google Scholar
  14. Lin Chen, Nicole Megow, and Kevin Schewior. New results on online resource minimization. arXiv preprint arXiv:1407.7998, 2014. URL: https://arxiv.org/abs/1407.7998.
  15. Lin Chen, Nicole Megow, and Kevin Schewior. An o(log m)-competitive algorithm for online machine minimization. In ACM-SIAM Symposium on Discrete Algorithms, 2015. URL: https://api.semanticscholar.org/CorpusID:8317885.
  16. Lin Chen, Nicole Megow, and Kevin Schewior. An o(m² log m)-competitive algorithm for online machine minimization. ArXiv, abs/1506.05721, 2015. URL: https://arxiv.org/abs/1506.05721.
  17. M. Chen and K. Lin. Dynamic priority ceilings: A concurrency control protocol for real-time systems. Real Time Systems, 2:326-346, 1990. Google Scholar
  18. Julia Chuzhoy and Paolo Codenotti. Erratum: Resource minimization job scheduling. In International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2009. URL: https://api.semanticscholar.org/CorpusID:2190162.
  19. Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, and Joseph Naor. Machine minimization for scheduling jobs with interval constraints. 45th Annual IEEE Symposium on Foundations of Computer Science, pages 81-90, 2004. URL: https://doi.org/10.1109/FOCS.2004.38.
  20. Mark Cieliebak, Thomas Wilhelm Erlebach, Fabian Hennecke, Birgitta Weber, and Peter Widmayer. Scheduling with release times and deadlines on a minimum number of machines. In IFIP TCS, 2004. URL: https://api.semanticscholar.org/CorpusID:15017335.
  21. Robert I. Davis. A review of fixed priority and edf scheduling for hard real-time uniprocessor systems. SIGBED Rev., 11(1):8-19, February 2014. URL: https://doi.org/10.1145/2597457.2597458.
  22. Nikhil R. Devanur, Konstantin Makarychev, Debmalya Panigrahi, and Grigory Yaroslavtsev. Online algorithms for machine minimization. ArXiv, abs/1403.0486, 2014. URL: https://arxiv.org/abs/1403.0486.
  23. Weiqiao Han and Karren D. Yang. Preemptive Online Machine Minimization, 2016. URL: https://api.semanticscholar.org/CorpusID:228102474.
  24. P.G. Jansen, Sape J. Mullender, Johan Scholten, and Paul J.M. Havinga. Lightweight EDF Scheduling with Deadline Inheritance. Number 2003-23 in CTIT-technical reports. Centre for Telematics and Information Technology (CTIT), Netherlands, May 2003. Imported from DIES. Google Scholar
  25. Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, and Dorothea Wagner. Competitive design and analysis for machine-minimizing job scheduling problem. In International Symposium on Algorithms and Computation, 2012. URL: https://api.semanticscholar.org/CorpusID:14459222.
  26. Antoon W. J. Kolen, Jan Karel Lenstra, Christos H. Papadimitriou, and Frits C. R. Spieksma. Interval scheduling: A survey. Naval Research Logistics (NRL), 54, 2007. URL: https://api.semanticscholar.org/CorpusID:15288326.
  27. Jing Li, Zheng Luo, David Ferry, Kunal Agrawal, Christopher Gill, and Chenyang Lu. Global edf scheduling for parallel real-time tasks. Real-Time Systems, 51:395-439, 2015. URL: https://doi.org/10.1007/S11241-014-9213-9.
  28. Luis Osorio-Valenzuela, Jordi Pereira, Franco Quezada, and Óscar C. Vásquez. Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints. Applied Mathematical Modelling, 2019. URL: https://api.semanticscholar.org/CorpusID:182422789.
  29. Cynthia A. Phillips, Cliff Stein, Eric Torng, and Joel Wein. Optimal time-critical scheduling via resource augmentation (extended abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC '97, pages 140-149, New York, NY, USA, 1997. Association for Computing Machinery. URL: https://doi.org/10.1145/258533.258570.
  30. Manar Qamhieh, Frédéric Fauberteau, Laurent George, and Serge Midonnet. Global edf scheduling of directed acyclic graphs on multiprocessor systems. In Proceedings of the 21st international conference on real-time networks and systems, pages 287-296, 2013. URL: https://doi.org/10.1145/2516821.2516836.
  31. R Rajkumar. Synchronization in Real-Time Systems A Priority Inheritance Approach. Springer, 1991. Google Scholar
  32. R. Rajkumar, L. Sha, and J.P. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proceedings. Real-Time Systems Symposium, pages 259-269, 1988. URL: https://doi.org/10.1109/REAL.1988.51121.
  33. Gurulingesh Raravi, Vincent Nélis, and Björn Andersson. Real-time scheduling with resource sharing on uniform multiprocessors. In Proceedings of the 20th International Conference on Real-Time and Network Systems, RTNS '12, pages 121-130, New York, NY, USA, 2012. Association for Computing Machinery. URL: https://doi.org/10.1145/2392987.2393003.
  34. Jim Ras and Albert M.K. Cheng. An evaluation of the dynamic and static multiprocessor priority ceiling protocol and the multiprocessor stack resource policy in an smp system. In 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 13-22, 2009. URL: https://doi.org/10.1109/RTAS.2009.10.
  35. Barna Saha. Renting a cloud. In Foundations of Software Technology and Theoretical Computer Science, 2013. URL: https://api.semanticscholar.org/CorpusID:17196958.
  36. L. Sha, R. Rajkumar, and J.P. Lehoczky. Priority inheritance protocols: an approach to real-time synchronization. IEEE Transactions on Computers, 39(9):1175-1185, 1990. URL: https://doi.org/10.1109/12.57058.
  37. John A Stankovic, Marco Spuri, Krithi Ramamritham, and Giorgio Buttazzo. Deadline scheduling for real-time systems: EDF and related algorithms, volume 460. Springer Science & Business Media, 1998. Google Scholar
  38. Hang Su, Dakai Zhu, and Scott Brandt. An elastic mixed-criticality task model and early-release edf scheduling algorithms. ACM Trans. Des. Autom. Electron. Syst., 22(2), December 2016. URL: https://doi.org/10.1145/2984633.
  39. Alexander Wieder and Björn B. Brandenburg. On spin locks in autosar: Blocking analysis of fifo, unordered, and priority-ordered spin locks. In 2013 IEEE 34th Real-Time Systems Symposium, pages 45-56, 2013. URL: https://doi.org/10.1109/RTSS.2013.13.
  40. Jia Xu and David Parnas. Scheduling processes with release times, deadlines, precedence and exclusion relations. IEEE Trans. Softw. Eng., 16(3):360-369, March 1990. URL: https://doi.org/10.1109/32.48943.
  41. Fengxiang Zhang. Analysis for EDF Scheduled Real Time Systems. Department for Computer Science, University of York, 2009. Google Scholar
  42. HaiFeng Zhu, J.P. Hansen, J.P. Lehoczky, and R. Rajkumar. Optimal partitioning for quantized edf scheduling. In 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., pages 212-222, 2002. URL: https://doi.org/10.1109/REAL.2002.1181576.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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