The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2002)
Fort Lauderdale, Florida
Apr. 15, 2002 to Apr. 19, 2002
ISBN: 0-7695-1573-8
pp: 8 pp
B. Andersson , Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
J. Jonsson , Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
ABSTRACT
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.
INDEX TERMS
Processor scheduling, Scheduling algorithm, Real time systems, Multiprocessing systems, Partitioning algorithms, Frequency, Process design, Research initiatives, Subspace constraints, Distributed processing,
CITATION
B. Andersson, J. Jonsson, "Preemptive multiprocessor scheduling anomalies", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 8 pp, 2002, doi:10.1109/IPDPS.2002.1015483
91 ms
(Ver )