Validating timing constraints in multiprocessor and distributed real-time systems:

Abstract: "Analytical and efficient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ha, Rhan (VerfasserIn), Liu, Jane W. S. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Urbana, Ill. Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science 1993
Schlagworte:
Zusammenfassung:Abstract: "Analytical and efficient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. This report presents several worst-case bounds and efficient algorithms for determining how late the completion times of independent jobs with arbitrary release times can be in a dynamic multiprocessor or distributed system. The special cases considered here are when the jobs are (1) preemptable and migratable, or (2) preemptable and nonmigratable, or (3) nonpreemptable."
Beschreibung:43 S. graph. Darst.