loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th Euromicro Conference on Real-Time Systems (ECRTS'06)
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
Dresden, Germany
July 05-July 07
ISBN: 0-7695-2619-5
ASCII Text
x 
 
Nathan Fisher, Sanjoy Baruah, Theodore P. Baker, "The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities," Real-Time Systems, Euromicro Conference on, pp. 118-127, 18th Euromicro Conference on Real-Time Systems (ECRTS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ECRTS.2006.30,
author = {Nathan Fisher and Sanjoy Baruah and Theodore P. Baker},
title = {The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities},
journal ={Real-Time Systems, Euromicro Conference on},
volume = {0},
year = {2006},
issn = {1068-3070},
pages = {118-127},
doi = {http://doi.ieeecomputersociety.org/10.1109/ECRTS.2006.30},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Systems, Euromicro Conference on
TI - The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
SN - 1068-3070
SP118
EP127
A1 - Nathan Fisher,
A1 - Sanjoy Baruah,
A1 - Theodore P. Baker,
PY - 2006
KW - null
VL - 0
JA - Real-Time Systems, Euromicro Conference on
ER -
 
Nathan Fisher, University of North Carolina at Chapel Hill
Sanjoy Baruah, University of North Carolina at Chapel Hill
Theodore P. Baker, Florida State University
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduling on each individual processor. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is not optimal. A quantitative characterization of its worst-case performance is provided in terms of sufficient conditions and resource augmentation approximation bounds. The partitioning algorithm is also evaluated over randomly generated task systems.
Citation:
Nathan Fisher, Sanjoy Baruah, Theodore P. Baker, "The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities," ecrts, pp.118-127, 18th Euromicro Conference on Real-Time Systems (ECRTS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.