Validating Timing Constraints of Dependent Jobs with Variable Execution Times in Distributed Real-Time Systems

In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors can be used to achieve better performance. However, analytical and efficient validation methods for determining whether all the timing constraints are met do not yet exist for systems using modern dynamic scheduling strategies, and exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. In this paper, we present several upper bounds and efficient algorithms for computing the worst-case completion times of dependent jobs in dynamic systems where jobs are dispatched and scheduled on available processors in a priority-driven manner. The bounds and algorithms consider arbitrary release times and variable execution times. We present conditions under which dependent jobs execute in a predictable manner.

[1]  Ching-Chih Han,et al.  A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms , 1997, Proceedings Real-Time Systems Symposium.

[2]  Jun Sun,et al.  An end-to-end approach to schedule tasks with shared resources in multiprocessor systems , 1994, Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software.

[3]  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).

[4]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[5]  Jane W.-S. Liu,et al.  Validating Real-Time Constraints in Heterogeneous Multiprocessor and Distributed Systems , 1999, J. Syst. Integr..

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

[7]  Howard Wong-Toi,et al.  Schedulability analysis of acyclic processes , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[8]  Jane W.-S. Liu,et al.  Methods for validating real-time constraints , 1995, J. Syst. Softw..

[9]  Jun Sun,et al.  Bounding completion times of jobs with arbitrary release times and variable execution times , 1996, 17th IEEE Real-Time Systems Symposium.

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

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

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