12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06) (2006)
Aug. 16, 2006 to Aug. 18, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.12
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.
N. Fisher, S. Baruah and T. P. Baker, "Algorithms for Determining the Demand-Based Load of a Sporadic Task System," 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)(RTCSA), Sydney, Australia, 2006, pp. 135-146.