Optimal rate-based scheduling on multiprocessors

Authors:
Anand Srinivasan;James H. Anderson
Affiliations:
Department of Computer Science, University of North Carolina, Chapel Hill, NC;Department of Computer Science, University of North Carolina, Chapel Hill, NC
Venue:
Journal of Computer and System Sciences
Year:
2006

Citing 15
Cited 5

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
Parallel Switching in Connection-Oriented Networks

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A Theory of Rate-Based Execution

RTSS '99 Proceedings of the 20th 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)
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT

FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Quick-release Fair Scheduling

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

Journal of Computer and System Sciences
Efficient and flexible fair scheduling of real-time tasks on multiprocessors

Efficient and flexible fair scheduling of real-time tasks on multiprocessors
Fair Integrated Scheduling of Soft Real-time Tardiness Classes on Multiprocessors

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Fine-Grained Task Reweighting on Multiprocessors

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
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
Early-release fair scheduling

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

Tardiness bounds under global EDF scheduling on a multiprocessor

Real-Time Systems
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms

Journal of Experimental Algorithmics (JEA)
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform

International Journal of Grid and Utility Computing
An evaluation of the RUN algorithm in LITMUSRT

ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is also optimal for scheduling "rate-based" tasks whose processing steps may be highly jittered. The rate-based task model we consider generalizes the widely-studied sporadic task model.