Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT

Algorithm 2

Step  1. Arrange computation times according to shortest job first,

𝐶₁≤𝐶₂≤𝐶₃≤⋯≤𝐶_𝑘≤⋯≤𝐶_𝑚

Step  2. Worst case response time of tasks analyzed. It is the maximum time lapse for a task to

start to execute. So it is known that,

𝑊𝜏(1)=𝐶_𝑚

˚

𝑊𝜏(𝑘)=hc(𝑘) + 𝐶_𝑚

˚

𝑊𝜏(𝑚)=hc(𝑚)

Step  3. 𝑇₁=𝑊𝜏(1)+𝐶₁;

Step  4. for 𝑖=2 to 𝑚 do

      𝑇_𝑖=𝑊𝜏(𝑖)

   end for

Step  5. Worst case utilization bound, 𝑈(𝜏)=∑_{𝜏𝑖∈𝜏}𝑈_𝑖 where 𝑈_𝑖=𝐶_𝑖/𝑇_𝑖

Step  6. Check schedulability of “𝑚” tasks by general schedulability test and find success

ratio and effective processor utilization.

Step  7. exit.