Latest revision as of 17:56, 28 January 2021

Abstract

While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipeline-based precedence constraints are common in practice. In this paper, such complexities are considered in the context of the global earliest-deadline-first scheduling algorithm. It is shown that any periodic task system with such dependencies can be transformed into one with only suspensions in a way that preserves maximum per-task response times. This result enables analysis directed at systems with suspensions to be applied if non-preemptive sections and/or pipelines are present as well.

Original document

The different versions of the original document can be found in:

• http://cs.unc.edu/~anderson/papers/rtas10c.pdf

• http://xplorestaging.ieee.org/ielx5/5465896/5465951/05465963.pdf?arnumber=5465963,

http://dx.doi.org/10.1109/rtas.2010.12

• https://www.cs.unc.edu/~anderson/papers/rtas10c.pdf,

http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005465963,

https://dblp.uni-trier.de/db/conf/rtas/rtas2010.html#LiuA10,

http://www.utdallas.edu/~cxl137330/paper/RTAS10.pdf,

https://academic.microsoft.com/#/detail/1989721383