Editing Rate-monotonic scheduling (section)

===Example 1===

{| class="wikitable"
|-
! Process
! Computation time ''C''
! Release period ''T''
! Priority
|-
! P1
| 1
| 8
| 2
|-
! P2
| 2
| 5
| 1
|-
! P3
| 2
| 10
| 3
|-
|}

Under RMS, P2 has the highest release rate (i.e. the shortest release period) and so would have the highest priority, followed by P1 and finally P3.

==== Least Upper Bound ====

The utilization will be: 

:<math>U = \frac{1}{8} + \frac{2}{5} + \frac{2}{10} = 0.725</math>.

The sufficient condition for <math>3\,</math> processes, under which we can conclude that the system is schedulable is:

:<math>{U_{lub}} = 3(2^\frac{1}{3} - 1) = 0.77976</math>

Because <math>U < U_{lub}</math>, and because being below the Least Upper Bound is a sufficient condition, the system is guaranteed to be schedulable.