SOLUTIONS FOR SOME PRACTICAL PROBLEMS IN PRIORITIZED PREEMPTIVE SCHEDULING.

A comprehensive treatment of a number of practical problems associated with the use of the rate monotonic algorithm is presented. These include the scheduling of messages over a bus with insufficient priority levels but with multiple buffers. Methods to handle aperiodic tasks are reviewed and a new approach to stabilize the rate monotonic algorithm in the presence of transit processor overloads is presented. The problem of integrated processor and data I/O scheduling is addressed. The results clearly establish the importance of using an integrated approach to schedule both the processor and data I/O activities.