Multiprocessor Scheduling of Periodic Tasks in a Hard Real-Time Environment

Authors:
Ashok Khemka;R. K. Shyamasundar
Affiliations:
-;-
Venue:
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Year:
1992

Citing 0
Cited 1

An $\mathsf{EDF}$ -based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Preemptive scheduling a set of periodic tasks on multiprocessors is studied from the point of view of meeting their service requirements before given deadlines. Sufficient conditions permitting full utilization of the multiprocessor using the given scheduling algorithm are derived. Complexity of the scheduling algorithms including upper bounds on the number of preemptions are derived. Schemes (with little run-time cost) for on-line handling of tasks' arrival and exit are given.