Validating Real-Time Constraints in Heterogeneous Multiprocessor and Distributed Systems

A heterogeneous system or distributed system typically contains different types of processors. Some jobs can execute on certain types of processors but not other types. Processors of different types may have different speeds. We present several worst-case upper bounds and efficient algorithms for determining the completion times of independent jobs that have arbitrary timing constraints and variable execution times and are scheduled on available processors dynamically in a priority-driven manner. Bounds and algorithms take into account the effects of nonmigratability, nonpreemptability and different levels of migratability.

[1]  J. Blaswicz.  Selected topics in scheduling theory , 1987 .

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

[3]  Rhan Ha,et al.  Validating timing constraints in multiprocessor and distributed systems , 1995 .

[4]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

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

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

[7]  Hideyuki Tokuda,et al.  Integrated management of priority inversion in Real-Time Mach , 1993, 1993 Proceedings Real-Time Systems Symposium.

[8]  Lui Sha,et al.  Scheduling sporadic and aperiodic events in a hard real-time system. Final report , 1989 .

[9]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[10]  John P. Lehoczky,et al.  Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems , 1994, IEEE Trans. Software Eng..

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

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

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