Sciweavers

Share
IPPS
2005
IEEE

Desynchronized Pfair Scheduling on Multiprocessors

9 years 6 months ago
Desynchronized Pfair Scheduling on Multiprocessors
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical implementation. In this paper, we address one such limitation — which requires processor time to always be allocated in units of fixed-sized quanta that are synchronized across processors — and determine the impact of relaxing it. We show that if this requirement is relaxed, then under an otherwise-optimal Pfair scheduling algorithm, deadlines are missed by at most one quantum only, which is sufficient to provide soft real-time guarantees. This result can be shown to extend to most prior work on Pfair scheduling: In general, tardiness bounds guaranteed by previously-proposed suboptimal Pfair algorithms are worsened by at most one quantum only. ∗ Work supported by NSF grants CCR 0204312, CCR 0309825, and CCR 0408996.
UmaMaheswari C. Devi, James H. Anderson
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where IPPS
Authors UmaMaheswari C. Devi, James H. Anderson
Comments (0)
books