Preemptive Multiprocessor Scheduling Anomalies
Paper i proceeding, 2002

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.

Författare

Björn Andersson

Chalmers, Institutionen för datorteknik

Jan Jonsson

Institutionen för datorteknik, Realtidssystem

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, Ft Lauderdale, Florida, April 15–19, 2002

12-19

Ämneskategorier

Datorteknik

Datavetenskap (datalogi)

Styrkeområden

Informations- och kommunikationsteknik

DOI

10.1109/IPDPS.2002.1015483

ISBN

0-7695-1573-8