This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE Real-Time Systems Symposium (RTSS '97)
Jitter concerns in periodic task systems
San Francisco, CA
December 03-December 05
ISBN: 0-8186-8268-X
S.K. Baruah, Vermont Univ., Burlington, VT, USA
D. Chen, Vermont Univ., Burlington, VT, USA
A.K. Mok, Vermont Univ., Burlington, VT, USA
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.
Index Terms:
real-time systems; periodic task systems; jitter; frame arrival time uncertainty; feasibility analysis; dynamic priority scheduling; preemptive scheduling; uniprocessor scheduling; computational complexity; real time systems
Citation:
S.K. Baruah, D. Chen, A.K. Mok, "Jitter concerns in periodic task systems," rtss, pp.68, 18th IEEE Real-Time Systems Symposium (RTSS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.