January 1, 1990

Fixed priority scheduling of periodic task sets with arbitrary deadlines

Key Points

Key points are not available for this paper at this time.

Abstract

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. 1

Ask AI

Mark Helpful

Bookmark

Relay

Cite This Study

John P. Lehoczky (Mon,) studied this question.

synapsesocial.com/papers/6a2025674f3426e554a1bd9a https://doi.org/https://doi.org/10.1109/real.1990.128748

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The rate monotonic scheduling algorithm: exact characterization and average case behavior2003 · 1,463 citations
2Real-time scheduling theory and Ada1990 · 338 citations
3Task synchronization in real-time systems1989 · 61 citations
4Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment1973 · 8,336 citations
5SOLUTIONS FOR SOME PRACTICAL PROBLEMS IN PRIORITIZED PREEMPTIVE SCHEDULING.1986 · 250 citations

Ask AI

Mark Helpful

Bookmark

Relay