Response Time Upper Bounds for Fixed Priority Real-Time Systems
Robert Davis and Alan Burns
This paper derives closed form upper bounds on the response times of tasks in fixed priority real-time systems. These bounds are valid for tasks with arbitrary deadlines, release jitter, and blocking. Response time upper bounds are given for tasks that are scheduled pre-emptively, co-operatively with intervals where pre-emption is deferred, and non-preemptively. The set of upper bounds for n tasks can be computed in O(n) time, providing a linear-time sufficient schedulability test, applicable to complex commercial real-time systems.
BibTex Entry
@inproceedings{Davis2008a,
author = {Robert Davis and Alan Burns},
booktitle = {Real-Time Systems Symposium (RTSS)},
month = {December},
pages = {407-418},
publisher = {IEEE Computer Society},
title = {Response Time Upper Bounds for Fixed Priority Real-Time Systems},
year = {2008}
}