Fixed-priority scheduling of real-time systems using utilization bounds

We have developed a new technique for determining at design time, the utilization bound for a specific set of hard real-time periodic tasks with known periods, when scheduled by any arbitrary fixed priority algorithm. The technique does not depend on precise knowledge of task computation times and does not require that task deadlines coincide with the arrival of the next request of the task. In this paper, we describe the technique and discuss how it can be applied to facilitate an engineering approach to the problem of task scheduling in hard real-time systems.

[1]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

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

[3]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

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

[5]  Jane W.-S. Liu,et al.  Imprecise Results: Utilizing Partial Comptuations in Real-Time Systems , 1987, RTSS.

[6]  Dong-Won Park,et al.  A generalized utilization bound test for fixed-priority real-time scheduling , 1995, Proceedings Second International Workshop on Real-Time Computing Systems and Applications.