Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems

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.

[1]  Tarek F. Abdelzaher,et al.  A Delay Composition Theorem for Real-Time Pipelines , 2007, 19th Euromicro Conference on Real-Time Systems (ECRTS'07).

[2]  Frédéric Ridouard.  Worst-case analysis of feasibility tests for self-suspending tasks , 2006 .

[3]  Michael González Harbour,et al.  Response time analysis of EDF distributed real-time systems , 2005, J. Embed. Comput..

[4]  James H. Anderson,et al.  Supporting Sporadic Pipelined Tasks with Early-Releasing in Soft Real-Time Multiprocessor Systems , 2009, 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[5]  Giuseppe Lipari,et al.  Improved schedulability analysis of real-time transactions with earliest deadline scheduling , 2005, 11th IEEE Real Time and Embedded Technology and Applications Symposium.

[6]  James H. Anderson,et al.  Supporting Pipelines in Soft Real-Time Multiprocessor Systems , 2009, 2009 21st Euromicro Conference on Real-Time Systems.

[7]  Hennadiy Leontyev,et al.  Generalized tardiness bounds for global multiprocessor scheduling , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[8]  Tarek F. Abdelzaher,et al.  Transforming Distributed Acyclic Systems into Equivalent Uniprocessors under Preemptive and Non-Preemptive Scheduling , 2008, 2008 Euromicro Conference on Real-Time Systems.

[9]  Pascal Richard,et al.  Negative results for scheduling independent hard real-time tasks with self-suspensions , 2004, 25th IEEE International Real-Time Systems Symposium.

[10]  James H. Anderson,et al.  Tardiness Bounds under Global EDF Scheduling on a Multiprocessor , 2005, RTSS.

[11]  Michael González Harbour,et al.  Schedulability analysis for tasks with static and dynamic offsets , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[12]  James H. Anderson,et al.  Task Scheduling with Self-Suspensions in Soft Real-Time Multiprocessor Systems , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[13]  UmaMaheswari Devi,et al.  An improved schedulability test for uniprocessor periodic task systems , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[14]  Jane W.-S. Liu.  Real-Time Systems , 2000, Encyclopedia of Algorithms.

[15]  Kyung-Hee Choi,et al.  Real-time scheduling of tasks that contain the external blocking intervals , 1995, Proceedings Second International Workshop on Real-Time Computing Systems and Applications.