Issue No. 10 - October (1997 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.637146
<p><b>Abstract</b>—The well-known periodic task model of Liu and Layland [<ref rid="bibe063510" type="bib">10</ref>] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a task is much longer than the average. In this paper, we give a multiframe real-time task model which allows the execution time of a task to vary from one instance to another by specifying the execution time of a task in terms of a sequence of numbers. We investigate the schedulability problem for this model for the preemptive fixed priority scheduling policy. We show that a significant improvement in the utilization bound can be established in our model.</p>
Real-time, task model, scheduling, utilization bound.
A. K. Mok and D. Chen, "A Multiframe Model for Real-Time Tasks," in IEEE Transactions on Software Engineering, vol. 23, no. , pp. 635-645, 1997.