Comparative Analysis of Real-Time Scheduling Algorithms on One Processor under Rate Monotonic
Omar U. Pereira Zapata, Luis Eduardo Leyva del Foyo · 2005
In this paper, a performance analysis is conducted for the best-known real-time schedulability tests executing under the Rate Monotonic Scheduling policy on one processor. The schedulability test verifies the fulfillment of the temporal constraints in a task set. We survey the inexact and exact schedulability conditions used in the scheduling of periodic and preemptable real-time tasks on uniprocessors using Rate Monotonic. Extensive simulation experiments are conducted to eval-uate the inexact schedulability conditions and to compare their performance and computational complexity. 1