Desynchronized Pfair Scheduling on Multiprocessors

Authors:
UmaMaheswari C. Devi;James H. Anderson
Affiliations:
The University of North Carolina, Chapel Hill;The University of North Carolina, Chapel Hill
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Year:
2005

Citing 8
Cited 3

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Optimal rate-based scheduling on multiprocessors

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fast scheduling of periodic tasks on multiple resources

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Pfair scheduling: beyond periodic task systems

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems

RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

Journal of Computer and System Sciences
Implementing Pfairness on a Symmetric Multiprocessor

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
On the implementation of pfair-scheduled multiprocessor systems

On the implementation of pfair-scheduled multiprocessor systems

Task Parallel Scheduling over Multi-core System

CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
Real-time scheduling using regularity criteria and a geometrical approach

International Journal of Critical Computer-Based Systems
Integrating PFairness within a model based scheduling tool

VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, which may lead to wasted processor time, is relaxed, then under an otherwiseoptimal 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.