Scheduling distance-constrained real-time tasks

A novel model of real-time task systems with temporal distance constraints is presented. In such systems, the distance between any two consecutive finishing times of the same task must be less than or equal to a given value. Using the periodic task model for such tasks may not provide an efficient solution. The authors discuss the scheduling approaches for this distance-constrained task model and propose several scheduling algorithms. They also study the schedulability conditions for these algorithms.<<ETX>>

[1]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[2]  Louis E. Rosier,et al.  The pinwheel: a real-time scheduling problem , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[3]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[4]  K. J. Lin,et al.  Scheduling jobs with temporal consistency constraints , 1989 .

[5]  Louis E. Rosier,et al.  Pinwheel Scheduling with Two Distinct Numbers , 1992, Theor. Comput. Sci..

[6]  Francis Y. L. Chin,et al.  General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction , 1992, IEEE Trans. Computers.

[7]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[8]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..