On the schedulability analysis for distributed hard real-time systems

We investigate into the validity of the rate monotonic analysis techniques for distributed hard real time systems. A recent paper has shown that the algorithm developed by K. Tindell and J. Clark (1994) for the analysis of this kind of system was incomplete because it did not test all the possible cases. We prove that the algorithm is valid as it is stated and that it effectively obtains an upper bound for the worst case response times to external events in distributed systems, since the longest response always occurs within the cases that are currently tested by this algorithm. In addition, we extend the analysis technique to determine an upper bound for the local response times of particular actions in a response to an event, thus allowing the definition and verification of local deadlines for elementary actions in distributed systems.

[1]  J. Javier Gutiérrez,et al.  Optimized priority assignment for tasks and messages in distributed hard real-time systems , 1995, Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems.

[2]  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.

[3]  J. Javier Gutiérrez,et al.  Increasing schedulability in distributed hard real-time systems , 1995, Proceedings Seventh Euromicro Workshop on Real-Time Systems.

[4]  M. Saksena,et al.  A Practitioner's Handbook for Real-time Analysis-guide to Rate Monotonic Analysis for Real Time Systems. Symbolic Model Checking for Event-driven Real-time Systems. Acm Toplas , 2007 .

[5]  Jun Sun,et al.  Bounding the end-to-end response times of tasks in a distributed real-time system using the direct synchronization protocol , 1996 .

[6]  L. Sha,et al.  A systematic approach to designing distributed real-time systems , 1995, Computer.

[7]  Shirish S. Sathaye,et al.  A Systematic Approach to Design Distributed Real-Time Systems , 1993, Computer.

[8]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[9]  W. Tindell.  AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS , 1994 .

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

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