DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling

Authors:
Greg Levin;Shelby Funk;Caitlin Sadowski;Ian Pye;Scott Brandt
Affiliations:
-;-;-;-;-
Venue:
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Year:
2010

Citing 0
Cited 9

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
Swapping to reduce preemptions and migrations in EKG

ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems
Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

Real-Time Systems
Utility accrual object distribution in MPSoC real-time embedded systems

Journal of Computer and System Sciences
Implementation and evaluation of global and partitioned scheduling in a real-time OS

Real-Time Systems
Task assignment algorithms for two-type heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of optimal real-time scheduling of periodic and sporadic tasks for identical multiprocessors. A number of recent papers have used the notions of fluid scheduling and deadline partitioning to guarantee optimality and improve performance. In this paper, we develop a unifying theory with the DP-FAIR scheduling policy and examine how it overcomes problems faced by greedy scheduling algorithms. We then present a simple DP-FAIR scheduling algorithm, DP-WRAP, which serves as a least common ancestor to many recent algorithms. We also show how to extend DP-FAIR to the scheduling of sporadic tasks with arbitrary deadlines.