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
No takes yet. Share an insight, caveat, or question.
John P. Lehoczky (1990) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: