Abstract
This paper derives closed from 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.
| Original language | English |
|---|---|
| Title of host publication | IEEE Real-Time Systems Symposium |
| Pages | 407-418 |
| Number of pages | 12 |
| DOIs | |
| Publication status | Published - Dec 2008 |
Keywords
- real-time
- schedulability analysis
- scheduling
- fixed priority
- uniprocessor