Jitter concerns in periodic task systems

Authors:
S. K. Baruah;D. Chen;A. K. Mok
Affiliations:
-;-;-
Venue:
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Year:
1997

Citing 0
Cited 6

Timing Constraint Remapping to Achieve Time Equi-Continuity in Distributed Real-Time Systems

IEEE Transactions on Computers
Real-Time Virtual Resource: A Timely Abstraction for Embedded Systems

EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
The Quality of Service Satisfiability Thesis: Resource and Performance Prediction for Multi-Processor Systems and Random Schedules

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
A Technique for Adaptive Scheduling of Soft Real-Time Tasks

Real-Time Systems
Windows scheduling of arbitrary-length jobs on multiple machines

Journal of Scheduling
State-based scheduling with tree schedules: analysis and evaluation

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

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.