A better polynomial-time schedulability test for real-time multiframe tasks

The well-known real-time periodic task model first studied by Liu and Layland [11] assumes that each task tau has a worst-case computation time C and each execution (instance) of the task takes no more than C time units. Based on the worst-case computation time assumption, Liu and Layland derived a utilization bound under which all task sets are schedulable by the fixed-priority scheduling scheme. The assumption and the derived utilization bound are, however too pessimistic when the average computation rimes of the tasks are smaller than their worst-case computation times. To improve the schedulability test for such kind of task sets, Mok and Chen proposed a multiframe task model [12, 13]for characterizing real-time tasks whose computation times vary instance by instance. They also derived an improved utilization bound for multiframe task sets. Although Mok and Chen's utilization bound is better than Liu and Layland's bound, it is still too pessimistic in the sense that a lot of feasible task sets may not be found schedulable using their utilization bound. In [4], we proposed a new, better polynomial-rime schedulability test for periodic task model. We found that similar technique can be applied to multiframe task model. In this paper we discuss how the previously-proposed schedulability test can be modified for multiframe task model. We also show that our schedulability test is much better than using Mok and Chen's utilization bound by giving theoretical reasoning and presenting thorough performance evaluation results.