This paper considers the problem of fixed priority scheduling of periodic tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the Liu and Layland bound. The results are shown to provide a basis for developing predictable distributed real-time systems.
Later, Lehoczky developed an exact schedulability criterion for the fixed priority scheduling of periodic tasks with arbitrary deadlines REF .
Fixed priority scheduling of periodic task sets with arbitrary deadlines
[1990] Proceedings 11th Real-Time Systems Symposium
[1990] Proceedings 11th Real-Time Systems Symposium
Computer Science