Fair scheduling of dynamic task systems on multiprocessors

Authors:
Anand Srinivasan;James H. Anderson
Affiliations:
Department of Computer Science, University of North Carolina, 256, Sitterson Hill, CB #3175, Chapel Hill, NC 27599-3175, USA;Department of Computer Science, University of North Carolina, 256, Sitterson Hill, CB #3175, Chapel Hill, NC 27599-3175, USA
Venue:
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
Year:
2005

Citing 7
Cited 11

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
A proportional share resource allocation algorithm for real-time, time-shared systems

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
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
Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4

Efficient scheduling of soft real-time applications on multiprocessors

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
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
Scheduling Recurrent Precedence-Constrained Task Graphs on a Symmetric Shared-Memory Multiprocessor

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
Redline: first class support for interactivity in commodity operating systems

OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

Real-Time Systems
A new fair scheduling algorithm for periodic tasks on multiprocessors

Information Processing Letters
Supporting soft real-time parallel applications on multiprocessors

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In dynamic real-time task systems, tasks that are subject to deadlines are allowed to join and leave the system. In previous work, Stoica et al. and Baruah et al. presented conditions under which such joins and leaves may occur in fair-scheduled uniprocessor systems without causing missed deadlines. In this paper, we extend their work by considering fair-scheduled multiprocessors. We show that their conditions are sufficient on M processors, under any deadline-based Pfair scheduling algorithm, if the utilization of every subset of M-1 tasks is at most one. Further, for the general case in which task utilizations are not restricted in this way, we derive sufficient join/leave conditions for the PD^2 Pfair algorithm. We also show that, in general, these conditions cannot be improved upon without causing missed deadlines.