The Case for Fair Multiprocessor Scheduling

Authors:
Anand Srinivasan;Philip Holman;James H. Anderson;Sanjoy Baruah
Affiliations:
-;-;-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 13

Minimizing migrations in fair multiprocessor scheduling of persistent tasks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing migrations in fair multiprocessor scheduling of persistent tasks

Journal of Scheduling
Frame-Based Proportional Round-Robin

IEEE Transactions on Computers
Efficient scheduling of soft real-time applications on multiprocessors

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Adapting Pfair scheduling for symmetric multiprocessors

Journal of Embedded Computing - Cache exploitation in embedded systems
Portioned EDF-based scheduling on multiprocessors

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
T-L plane-based real-time scheduling for homogeneous multiprocessors

Journal of Parallel and Distributed Computing
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
Real-time scheduling on heterogeneous system-on-chip architectures using an optimised artificial neural network

Journal of Systems Architecture: the EUROMICRO Journal
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler

Real-Time Systems
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
A technique to reduce preemption overhead in real-time multiprocessor task scheduling

ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Implementation and evaluation of global and partitioned scheduling in a real-time OS

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we compare the PD2 Pfair algorithm to the EDF-FF partitioning scheme, which uses "first fit" (FF) as a partitioning heuristic and the earliest-deadline-first (EDF) algorithm for per-processor scheduling. We present experimental results that show that PD2 is competitive with, and in some cases outperforms, EDF-FF. These results suggest that Pfair scheduling is a viable alternative to partitioning. Furthermore, as discussed herein, Pfair scheduling provides many additional benefits, such as simple and efficient synchronization, temporal isolation, fault tolerance, and support for dynamic tasks.