Paper Info
Title
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
Abstract
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.
Year
DOI
Venue
2006
10.1109/RTCSA.2006.12
RTCSA
Keywords
Field
DocType
important role,sporadic task system,arbitrary additive error gt,load parameter,largest possible cumulative execution,time interval,accurate indicator,uniprocessor feasibility analysis,demand-based load,exact algorithm,task system,feasibility analysis,cumulant
Metrical task system,Uniprocessor system,Normalization (statistics),Computer science,Parallel computing,Algorithm,Real-time computing,Processor scheduling,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2676-4
29
1.47
References 
Authors
6
3
Name
Order
Citations
PageRank
Fisher, N.1675.23
T. P. Baker21648171.36
Sanjoy K. Baruah34664374.79