MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Preemptive Multiprocessor Scheduling Anomalies ∗

Download:
pdf
unknown authors
http://www.ce.chalmers.se/staff/ba/papers/ipdps02/ipdps02.us.pdf
Add To MetaCart

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. 1

Citations

2168 Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment – Liu, Layland - 1973
289 Bounds on Multiprocessing Timing Anomalies – Graham - 1969
97 On a Real-Time Scheduling Problem – Dhall, Liu - 1978
44 Resource reclaiming in multiprocessor real-time systems – Shen, Ramamritham, et al. - 1993
42 Timing anomalies in dynamically scheduled microprocessors – Lundqvist, Stenström - 1999
40 Utilization bounds for nprocessor rate monotone scheduling with static processor assignment – Oh, Bakker - 1998
23 Validating timing constraints in multiprocessor and distributed real-time systems – Ha, Liu - 1994
19 Fixed-priority preemptive multiprocessor scheduling: To partition or not to partition – Andersson, Jonsson - 2000
16 An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling – Lauzac, Melhem, et al. - 1998
15 Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling – Lopez, Diaz, et al. - 2001
8 Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling – Andersson, Jonsson - 2000
7 Greed in resource scheduling – Gillies, Liu - 1991
1 Tracking real-time systems requirements, December 12–14, 2000. invited talk at – Mok
1 Bounds on multiprocessor scheduling anomalies and related packing problem – Graham - 1972
1 Anomalous behavior in bin packing algorithms – Murgolo - 1988