Performance of real-time bus scheduling algorithms
- 1 May 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 14 (1), 44-53
- https://doi.org/10.1145/317531.317538
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Preemptive Scheduling with Release Times, Deadlines, and Due TimesJournal of the ACM, 1982
- Scheduling periodically occurring tasks on multiple processorsInformation Processing Letters, 1981
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973