Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems

This paper presents a timing analysis for a quite general hard real-time periodic task set on a uniprocessor using fixed-priority methods. Periodic tasks are composed of serially executed subtasks, where each subtask is characterized by an execution time, a fixed priority and a deadline. A method for determining the schedulability of each task and subtask is presented along with its theoretical underpinnings. This method can be used to analyze the schedulability of any task set on a uniprocessor whose priority structure can be modeled as serially executed subtasks, which can lead to a very complex priority structure. Important examples include task sets that involve interrupts, certain synchronization protocols, certain precedence constraints, nonpreemptible sections, and some message-passing systems. The method is illustrated by a robotics example. >

[1]  A. Burns,et al.  Scheduling hard real-time systems: a review , 1991, Softw. Eng. J..

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

[3]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

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

[5]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[6]  Jay K. Strosnider,et al.  Fixed Priority Scheduling Theory for Hard Real-Time Systems , 1991 .

[7]  Lui Sha,et al.  Performance of real-time bus scheduling algorithms , 1986, SIGMETRICS '86/PERFORMANCE '86.

[8]  John P. Lehoczky,et al.  Real-time scheduling support in Futurebus+ , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[9]  Alan Burns,et al.  Mode changes in priority preemptively scheduled systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[10]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[11]  L. Sha,et al.  The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks , 1988, IRTAW '88.

[12]  Jay K. Strosnider,et al.  Engineering and Analysis of Fixed Priority Schedulers , 1993, IEEE Trans. Software Eng..

[13]  Lui Sha,et al.  Real-time scheduling theory and Ada , 1990, Computer.

[14]  R. Obenza,et al.  Rate monotonic analysis for real-time systems , 1993, Computer.

[15]  John P. Lehoczky,et al.  Fixed priority scheduling periodic tasks with varying execution priority , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[16]  R. Rajkumar.  Real-time synchronization protocols for shared memory multiprocessors , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

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

[18]  Mark Klein,et al.  Real-Time Software Engineering in Ada: Observations and Guidelines , 1989 .

[19]  Mark Klein,et al.  An Analysis of Input/Output Paradigms for Real-Time Systems , 1990 .

[20]  Lui Sha,et al.  Real-time synchronization protocols for multiprocessors , 1988, Proceedings. Real-Time Systems Symposium.

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

[22]  Mark Klein,et al.  A practitioner's handbook for real-time analysis - guide to rate monotonic analysis for real-time systems , 1993, The Kluwer international series in engineering and computer science.