Task Scheduling In Distributed Real-Time Systems
Lui Sha, John P. Lehoczky, Ragunathan Rajkumar · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1987
In this paper, we give a comprehensive review of a number of practical problems associated with the use of static priority scheduling. We first present a new approach to stabilize the rate-monotonic algorithm in the presence of transient processor overloads. We also present a new class of algorithms to handle aperiodic tasks which improve the response times to aperiodic tasks while guaranteeing the deadlines of periodic tasks. We then study the problem of integrated processor and data I/O scheduling. Finally we review the problem of scheduling of messages over a bus with insufficient priority levels but with multiple buffers.