Sciweavers

RTCSA
2006
IEEE

Algorithms for Determining the Demand-Based Load of a Sporadic Task System

14 years 12 days ago
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
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 > 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.
Nathan Fisher, Theodore P. Baker, Sanjoy K. Baruah
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where RTCSA
Authors Nathan Fisher, Theodore P. Baker, Sanjoy K. Baruah
Comments (0)