Fort Lauderdale, Florida
Apr. 15, 2002 to Apr. 19, 2002
Björn Andersson , Chalmers University of Technology
Jan Jonsson , Chalmers University of Technology
Preemptive scheduling of periodically arriving tasks on a multiprocessor is considered. We show that many common multiprocessor real-time scheduling algorithms suffer from scheduling anomalies, that is, deadlines are originally met, but a decrease in execution times or an increase in periods of tasks can cause deadlines to be missed. We propose a partitioned multiprocessor fixed-priority scheduling algorithm with the prominent features that (i) it does not suffer from such scheduling anomalies and (ii) if less than 41% of the capacity is used then deadlines are met.
Björn Andersson, Jan Jonsson, "Preemptive Multiprocessor Scheduling Anomalies", IPDPS, 2002, Parallel and Distributed Processing Symposium, International, Parallel and Distributed Processing Symposium, International 2002, pp. 0012, doi:10.1109/IPDPS.2002.1015483