Name
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/REAL.1997.641270 | RTSS |
Keywords | Field | DocType |
computational complexity,jitter,real-time systems,scheduling,computational complexity,dynamic priority scheduling,feasibility analysis,frame arrival time uncertainty,jitter,periodic task systems,preemptive scheduling,real time systems,uniprocessor scheduling | Metrical task system,Preemption,Algorithm design,Scheduling (computing),Computer science,Real-time computing,Jitter,Dynamic priority scheduling,Periodic graph (geometry),Distributed computing,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1052-8725 | 0-8186-8268-X | 8 |
PageRank | References | Authors |
0.85 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. K. Baruah | 1 | 379 | 40.38 |
| D. Chen | 2 | 8 | 0.85 |
| Aloysius K. Mok | 3 | 662 | 86.52 |