Generalized rate monotonic schedulability bounds using relative period ratios
One of the most well-studied scheduling algorithms For real-time systems is the Rate Monotonic (RM) scheduling for periodic tasks. In this paper we derive a generalized RM schedulability bound by considering relative period ratios among tasks in a system. We show that schedulability bounds published earlier are special cases of our generalized bound. Our new bound may provide it higher value than earlier results. (C) 2008 Elsevier B.V. All rights reserved.
real-time systems rate monotonic analysis schedulabilily conditions