This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 22nd Euromicro Conference on Real-Time Systems
DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
Brussels, Belgium
July 06-July 09
ISBN: 978-0-7695-4111-2
ASCII Text
x 
 
Greg Levin, Shelby Funk, Caitlin Sadowski, Ian Pye, Scott Brandt, "DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling," 2012 24th Euromicro Conference on Real-Time Systems, pp. 3-13, 2010 22nd Euromicro Conference on Real-Time Systems, 2010.
 
 
BibTex
x
 
@article{ 10.1109/ECRTS.2010.34,
author = {Greg Levin and Shelby Funk and Caitlin Sadowski and Ian Pye and Scott Brandt},
title = {DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling},
journal ={2012 24th Euromicro Conference on Real-Time Systems},
volume = {0},
year = {2010},
issn = {1068-3070},
pages = {3-13},
doi = {http://doi.ieeecomputersociety.org/10.1109/ECRTS.2010.34},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - 2012 24th Euromicro Conference on Real-Time Systems
TI - DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
SN - 1068-3070
SP3
EP13
A1 - Greg Levin,
A1 - Shelby Funk,
A1 - Caitlin Sadowski,
A1 - Ian Pye,
A1 - Scott Brandt,
PY - 2010
VL - 0
JA - 2012 24th Euromicro Conference on Real-Time Systems
ER -
 
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.
Citation:
Greg Levin, Shelby Funk, Caitlin Sadowski, Ian Pye, Scott Brandt, "DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling," ecrts, pp.3-13, 2010 22nd Euromicro Conference on Real-Time Systems, 2010
Usage of this product signifies your acceptance of the Terms of Use.