The well-known periodic task model of Liu and Layland (1973) 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. 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.
展开▼
机译：众所周知的Liu and Layland（1973）的周期性任务模型假设每个任务的最坏情况执行时间范围，如果任务的最坏情况执行时间比平均时间长得多，则可能过于悲观。我们提供了一种多帧实时任务模型，该模型通过以数字序列指定任务的执行时间，从而允许任务的执行时间在一个实例之间变化。我们研究了抢先固定优先级调度策略的该模型的可调度性问题。我们表明可以在我们的模型中建立利用率范围的显着改善。
展开▼
