loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
Sydney, Australia
August 16-August 18
ISBN: 0-7695-2676-4
ASCII Text
x 
 
Nathan Fisher, Theodore P. Baker, Sanjoy Baruah, "Algorithms for Determining the Demand-Based Load of a Sporadic Task System," Real-Time Computing Systems and Applications, International Workshop on, pp. 135-146, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2006.12,
author = {Nathan Fisher and Theodore P. Baker and Sanjoy Baruah},
title = {Algorithms for Determining the Demand-Based Load of a Sporadic Task System},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2006},
issn = {1533-2306},
pages = {135-146},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.12},
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 - Algorithms for Determining the Demand-Based Load of a Sporadic Task System
SN - 1533-2306
SP135
EP146
A1 - Nathan Fisher,
A1 - Theodore P. Baker,
A1 - Sanjoy Baruah,
PY - 2006
KW - null
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Nathan Fisher, The University of North Carolina at Chapel Hill, USA
Theodore P. Baker, Florida State University, USA
Sanjoy Baruah, The University of North Carolina at Chapel Hill, USA
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time interval, normalized by the length of the interval. This parameter is known to play a very important role in the uniprocessor feasibility analysis of sporadic task systems. In this paper, it is shown that the load of a sporadic task system may be used as an accurate indicator of its feasibility upon preemptive multiprocessors as well. Exact algorithms, and approximate ones that can be guaranteed to be accurate to within an arbitrary additive error gt 0, for computing a task system?s load are presented and proven correct. The performance of these algorithms is evaluated by simulation over randomly generated task systems.
Citation:
Nathan Fisher, Theodore P. Baker, Sanjoy Baruah, "Algorithms for Determining the Demand-Based Load of a Sporadic Task System," rtcsa, pp.135-146, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.