Schedulability Analysis for Rate Monotonic Algorithm-Shortest Job First Using UML-RT

Pseudocode 1

Step  1.  begin

Step  2.  for  𝜏_𝑖=𝜏₁to𝜏_𝑚 (𝑚 periodic task)

Step  3.  while there is a free processor 𝑀_𝑓  and an unassigned tasks do

Step  4.    pick higher priority task

Step  5.      assign (𝜏_𝑖,𝑀_𝑓)

Step  6.      if task executed within deadline

Step  7.       return “success”

Step  8.       else

Step  9.       return “failure”

Step  10.       endif

Step  11.  endwhile

Step  12. endfor