.png){kind=icon}
.png){kind=icon}
Return
A multiframe model for real-time tasks
.png){kind=icon}
PRE
AI
DOI：10.1109/32.637146.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The well-known periodic task model of Liu and Layland [10] 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.
Keywords:
real-time
task model
scheduling
utilization bound
Journal
IF:
5.6
Papers:
2.8K
Citations:
1.1W
Organization
No organization information available