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

Author

Fisher, Nathan ; Baker, Theodore P. ; Baruah, Sanjoy

Author_Institution

Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC

fYear

0

fDate

0-0 0

Firstpage

135

Lastpage

146

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 > 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

Keywords

multiprocessing systems; processor scheduling; cumulative execution requirement; demand-based load; multiprocessor system; sporadic task system; uniprocessor feasibility analysis; Character generation; Computational modeling; Computer science; Error correction; Law; Legal factors; Multiprocessing systems; Processor scheduling; Sufficient conditions; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on

Conference_Location

Sydney, Qld.

ISSN

1533-2306

Print_ISBN

0-7695-2676-4

Type

conf

DOI

10.1109/RTCSA.2006.12

Filename

1691307