Validating timing constraints in multiprocessor and distributed real-time systems

Authors:
Rhan Ha;Jane W.S. Liu
Affiliations:
-;-
Venue:
Validating timing constraints in multiprocessor and distributed real-time systems
Year:
1993

Citing 0
Cited 5

Deadline-based scheduling of periodic task systems on multiprocessors

Information Processing Letters
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors

IEEE Transactions on Computers
An Analysis of EDF Schedulability on a Multiprocessor

IEEE Transactions on Parallel and Distributed Systems
Two protocols to reduce the criticality level of multiprocessor mixed-criticality systems

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

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.