Tardiness Bounds under Global EDF Scheduling on a Multiprocessor

We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice, their runtime overheads can significantly reduce the amount of useful work that is accomplished. On the other hand, if all deadlines need to be met, then every known non-Pfair algorithm requires restrictions on total system utilization that can approach approximately 50% of the available processing capacity. This may be overkill for soft real-time systems, which can tolerate occasional or bounded deadline misses (i.e., bounded tardiness). In this paper we derive tardiness bounds under preemptive and non-preemptive global EDF when the total system utilization is not restricted, except that it not exceed the available processing capacity. Hence, processor utilization can be improved for soft real-time systems on multiprocessors. Our tardiness bounds depend on the total system utilization and per-task utiliza...

• Type: Conference
• Year: 2005
• Where: RTSS
• Authors: UmaMaheswari C. Devi, James H. Anderson
• Keywords: Applied Computing, RTSS 2005, Soft Real-time Systems, Tardiness Bounds, Utilization