loading...
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
Miami, Florida December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTSS.2005.4026th IEEE International Real-Time Sys ...
 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 
 
Sanjoy Baruah, Nathan Fisher, "The Partitioned Multiprocessor Scheduling of Sporadic Task Systems," Real-Time Systems Symposium, IEEE International, pp. 321-329, 26th IEEE International Real-Time Systems Symposium (RTSS'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/RTSS.2005.40,
author = {Sanjoy Baruah and Nathan Fisher},
title = {The Partitioned Multiprocessor Scheduling of Sporadic Task Systems},
journal ={Real-Time Systems Symposium, IEEE International},
volume = {0},
year = {2005},
issn = {1052-8725},
pages = {321-329},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTSS.2005.40},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Systems Symposium, IEEE International
TI - The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
SN - 1052-8725
SP321
EP329
A1 - Sanjoy Baruah,
A1 - Nathan Fisher,
PY - 2005
KW - null
VL - 0
JA - Real-Time Systems Symposium, IEEE International
ER -
 
Sanjoy Baruah, University of North Carolina at Chapel Hill
Nathan Fisher, University of North Carolina at Chapel Hill
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation: it is shown that any set of sporadic tasks that can be partitioned among the processors of an m-processor identical multiprocessor platform will be partitioned by this algorithm on an m-processor platform in which each processor is (4 - 2/m) times as fast.
Citation:
Sanjoy Baruah, Nathan Fisher, "The Partitioned Multiprocessor Scheduling of Sporadic Task Systems," rtss, pp.321-329, 26th IEEE International Real-Time Systems Symposium (RTSS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.