Scheduling periodic task systems to minimize output jitter

Output jitter-the variation in the intercompletion times of successive jobs of the same task is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties that are desirable in any jitter-minimization schedule is enumerated. Algorithms are presented for generating such schedules, and bounds proved for the maximum jitter in schedules generated by these algorithms.

[1]  Kwei-Jay Lin,et al.  Jitter control in time-triggered systems , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[2]  Aloysius K. Mok.  Task Management Techniques for Enforcing ED Scheduling on Periodic Task Set , 1988 .

[3]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[4]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[5]  John A. Stankovic,et al.  Dynamic end-to-end guarantees in distributed real time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[6]  Sanjoy K. Baruah,et al.  Jitter concerns in periodic task systems , 1997, Proceedings Real-Time Systems Symposium.

[7]  Domenico Ferrari.  Client requirements for real-time communication services , 1990 .

[8]  Domenico Ferrari,et al.  Client requirements for real-time communication services , 1990, IEEE Communications Magazine.

[9]  D.C. Verma,et al.  Delay jitter control for real-time communication in a packet switching network , 1991, Proceedings of TRICOMM `91: IEEE Conference on Communications Software: Communications for Distributed Applications and Systems.

[10]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.