Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

Authors:
James H. Anderson;Anand Srinivasan
Affiliations:
Department of Computer Science, University of North Carolina, 256 Sitterson Hill CB #3175, Chapel Hill, NC;Department of Computer Science, University of North Carolina, 256 Sitterson Hill CB #3175, Chapel Hill, NC
Venue:
Journal of Computer and System Sciences
Year:
2004

Citing 8
Cited 19

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
Fairness in periodic real-time scheduling

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks

ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Static-priority periodic scheduling on muitiprocessors

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Early-release fair scheduling

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems

Desynchronized Pfair Scheduling on Multiprocessors

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Task Reweighting on Multiprocessors: Efficiency versus Accuracy

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Fair scheduling of dynamic task systems on multiprocessors

Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
On distributed smooth scheduling

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Optimal rate-based scheduling on multiprocessors

Journal of Computer and System Sciences
Efficient scheduling of soft real-time applications on multiprocessors

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Parallel task scheduling on multicore platforms

ACM SIGBED Review - Special issue: The work-in-progress (WIP) session of the RTSS 2005
Tardiness bounds under global EDF scheduling on a multiprocessor

Real-Time Systems
Task reweighting under global scheduling on multiprocessors

Real-Time Systems
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

Real-Time Systems
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling

Journal of Computer and System Sciences
On bandwidth tiered service

IEEE/ACM Transactions on Networking (TON)
Generalized tardiness bounds for global multiprocessor scheduling

Real-Time Systems
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
On bounding response times under software transactional memory in distributed multiprocessor real-time systems

Proceedings of the Conference on Design, Automation and Test in Europe
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler

Real-Time Systems
Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pfair scheduling was proposed by Baruah, Cohen, Plaxton, and Varvel as a non-work-conserving way of optimally and efficiently scheduling periodic tasks on a multiprocessor. In this paper, we introduce a work-conserving variant of Pfair scheduling called "early-release" fair (ERfair) scheduling. We also present a new scheduling algorithm called PD2 and show that it is optimal for scheduling any mix of early-release and non-early-release asynchronous, periodic tasks. In contrast, almost all prior work on Pfair scheduling has been limited to synchronous systems. PD2 is an optimization of an earlier deadline-based algorithm of Baruah, Gehrke, and Plaxton called PD; PD2 uses a simpler tie-breaking scheme than PD to dis ambiguate equal deadlines. We present a series of counterexamples that suggest that, in general, the PD2 tie-breaking mechanism cannot be simplified. In contrast to this, we show that no tie-breaking information is needed on two-processor systems.