2012 24th Euromicro Conference on Real-Time Systems (2010)
July 6, 2010 to July 9, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ECRTS.2010.34
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.
Caitlin Sadowski, Shelby Funk, Greg Levin, Scott Brandt, Ian Pye, "DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling", 2012 24th Euromicro Conference on Real-Time Systems, vol. 00, no. , pp. 3-13, 2010, doi:10.1109/ECRTS.2010.34