On the periodic behavior of real-time schedulers on identical multiprocessor platforms

This paper is proposing a general periodicity result concerning any deterministic and memoryless scheduling algorithm (including non-work-conserving algorithms), for any context, on identical multiprocessor platforms. By context we mean the hardware architecture (uniprocessor, multicore), as well as task constraints like critical sections, precedence constraints, self-suspension, etc. Since the result is based only on the releases and deadlines, it is independent from any other parameter. Note that we do not claim that the given interval is minimal, but it is an upper bound for any cycle of any feasible schedule provided by any deterministic and memoryless scheduler.

[1]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.

[2]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[3]  Liliana Cucu-Grosjean,et al.  Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[4]  Kevin Jeffay,et al.  Accounting for interrupt handling costs in dynamic priority task systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[5]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[6]  Alexander Wieder,et al.  Efficient partitioning of sporadic real-time tasks with shared resources and spin locks , 2013, 2013 8th IEEE International Symposium on Industrial Embedded Systems (SIES).

[7]  Sanjoy K. Baruah,et al.  Static-priority scheduling on multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[8]  Emmanuel Grolleau,et al.  Minimal schedulability interval for real-time systems of periodic tasks with offsets , 2004, Theor. Comput. Sci..

[9]  Liliana Cucu-Grosjean,et al.  Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[10]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[11]  Alan Burns,et al.  A survey of hard real-time scheduling for multiprocessor systems , 2011, CSUR.

[12]  Thomas Nolte,et al.  Exact and approximate supply bound function for multiprocessor periodic resource model: unsynchronized servers , 2013, SIGBED.

[13]  Laurent George,et al.  A semi-partitioned approach for parallel real-time scheduling , 2012, RTNS '12.

[14]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[15]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[16]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[17]  Liliana Cucu-Grosjean,et al.  Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms , 2011, J. Syst. Archit..

[18]  Raymond R. Devillers,et al.  Feasibility intervals for the deadline driven scheduler with arbitrary deadlines , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[19]  Erik.  Scheduling of Hard Real-Time Periodic Systems with Various Kinds of Deadline and Offset Constraints , .

[20]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[21]  Frédéric Boniol,et al.  Scheduling Dependent Periodic Tasks without Synchronization Mechanisms , 2010, 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium.