loading...
Pfair scheduling: beyond periodic task systems
Cheju Island, South Korea December 12-December 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2000.896405Seventh International Conference on R ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
J.H. Anderson, A. Srinivasan, "Pfair scheduling: beyond periodic task systems," Real-Time Computing Systems and Applications, International Workshop on, pp. 297, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2000.896405,
author = {J.H. Anderson and A. Srinivasan},
title = {Pfair scheduling: beyond periodic task systems},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2000},
issn = {1533-2306},
pages = {297},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2000.896405},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - Pfair scheduling: beyond periodic task systems
SN - 1533-2306
SP
EP
A1 - J.H. Anderson,
A1 - A. Srinivasan,
PY - 2000
KW - scheduling; real-time systems; computational complexity; Pfair scheduling; periodic task systems; ER-fair scheduling; intra-sporadic tasks; polynomial-time algorithm; real time systems
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
J.H. Anderson, Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
A. Srinivasan, Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
We consider variants of Pfair and ER-fair scheduling in which subtasks may be released late, i.e., there may be separation between consecutive windows of the same task. We call such tasks intra-sporadic tasks. There are two main contributions. First, we show the existence of a Pfair (and hence ER-fair) schedule for any intra-sporadic task system whose utilization is at most the number of available processors. Second, we give a polynomial-time algorithm that is optimal for scheduling intra-sporadic tasks in a Pfair or ER-fair manner on systems of one or two processors.
Index Terms:
scheduling; real-time systems; computational complexity; Pfair scheduling; periodic task systems; ER-fair scheduling; intra-sporadic tasks; polynomial-time algorithm; real time systems
Citation:
J.H. Anderson, A. Srinivasan, "Pfair scheduling: beyond periodic task systems," rtcsa, pp.297, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.