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

The authors 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, they develop a unifying theory with the DP-FAIR scheduling policy and examine how it overcomes problems faced by greedy scheduling algorithms. They then present a simple DP-FAIR scheduling algorithm, DP-WRAP, which serves as a least common ancestor to many recent algorithms. They also show how to extend DP-FAIR to the scheduling of sporadic tasks with arbitrary deadlines.