A multiframe model for real-time tasks

The well-known periodic task model of Liu and Layland 1] 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 xed priority scheduling policy. We show that a signi cant improvement in the utilization bound can be established in our model. This work is supported by a grant from the O ce of Naval Research under grant number N00014-94-1-0582. 1 

• Type: Conference
• Year: 1996
• Where: RTSS
• Authors: Aloysius K. Mok, Deji Chen
• Keywords: Control Systems, Execution Time, RTSS 1996, Task Model, Worst-case Execution Time