When periodic tasks with hard deadlines communicate over a bus, the problem of hard real-time bus scheduling arises. This paper addresses several problems of hard real-time bus scheduling, including the evaluation of scheduling algorithms and the issues of message packet pacing, preemption, priority granularity and buffering.
No takes yet. Share an insight, caveat, or question.
Lehoczky et al. (1986) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: