Abstract
A model for periodic tasks is proposed that explicitly incorporates jitter - the uncertainty in the arrival times of individual frames. Feasibility-analysis of systems of such tasks is studied in the context of dynamic-priority, preemptive, uniprocessor scheduling. From a computational-complexity perspective, the problem is shown to be no more difficult than feasibility-analysis in systems of periodic tasks that do not exhibit jitter. Several feasibility-analysis algorithms are presented and proven correct.
| Original language | English |
|---|---|
| Pages | 68-77 |
| Number of pages | 10 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 18th IEEE Real-Time Systems Symposium - San Francisco, CA, USA Duration: Dec 2 1997 → Dec 5 1997 |
Conference
| Conference | Proceedings of the 1997 18th IEEE Real-Time Systems Symposium |
|---|---|
| City | San Francisco, CA, USA |
| Period | 12/2/97 → 12/5/97 |