Comprehensive Comparison of Schedulability Tests for Uniprocessor Rate-Monotonic Scheduling
Arnoldo Díaz-Ramírez, Pedro Mejía-Álvarez, Luis Eduardo Leyva-del-Foyo · Journal of Applied Research and Technology · 2013
Schedulability conditions are used in real-time systems to verify the fulfillment of the temporal constraints of task sets.In this paper, a performance analysis is conducted for the best-known real-time schedulability conditions that can beused in online admission control on uni-processor systems executing under the Rate-Monotonic scheduling policy.Since Liu and Layland introduced the Rate-Monotonic scheduling algorithm, many research studies have beenconducted on the schedulability analysis of real-time periodic task sets. However, in most cases, the performance ofthe proposed schedulability conditions were compared only against the Liu and Layland test and not against theremaining schedulability tests. The goal of this paper is to provide guidelines for system designers in order to decidewhich schedulability condition provides better performance under different task characteristics. Extensive simulationexperiments were conducted to evaluate the inexact schedulability conditions and compare their performance andcomputational complexity.