DocumentCode :
2973432
Title :
Jitter concerns in periodic task systems
Author :
Baruah, Sanjoy K. ; Chen, Deji ; Mok, Aloysius K.
Author_Institution :
Vermont Univ., Burlington, VT, USA
fYear :
1997
fDate :
5-5 Dec. 1997
Firstpage :
68
Lastpage :
77
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.
Keywords :
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; Algorithm design and analysis; Clocks; Contracts; Dynamic scheduling; Jitter; Processor scheduling; Real time systems; Scheduling algorithm; Sufficient conditions; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Systems Symposium, 1997. Proceedings., The 18th IEEE
Conference_Location :
San Francisco, CA, USA
ISSN :
1052-8725
Print_ISBN :
0-8186-6600-5
Type :
conf
DOI :
10.1109/REAL.1997.641270
Filename :
641270
Link To Document :
بازگشت