This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Parallel and Distributed Processing Symposium - Symposium Volume
Preemptive Multiprocessor Scheduling Anomalies
Fort Lauderdale, California
April 15-April 19
ISBN: 0-7695-1573-8
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.
Citation:
Björn Andersson, Jan Jonsson, "Preemptive Multiprocessor Scheduling Anomalies," ipdps, vol. 1, pp.0012, International Parallel and Distributed Processing Symposium - Symposium Volume, 2002
Usage of this product signifies your acceptance of the Terms of Use.