Abstract
A review of some practical problems associated with the use of static priority scheduling is given. An approach to stabilize the rate-monotonic algorithm in the presence of transient processor overloads is presented. Also presented is a class of algorithms to handle aperiodic tasks which improve response times while guaranteeing the deadlines of periodic tasks. The problem of integrated processor and data I/O scheduling is studied as well as the problem of scheduling of messages over a bus with insufficient priority levels and multiple buffers.
Original language | English (US) |
---|---|
Pages | 909-916 |
Number of pages | 8 |
State | Published - 1987 |
Externally published | Yes |
ASJC Scopus subject areas
- General Engineering