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

Algorithm 3

(i) According to the definition of final job,

   if 𝑟_𝑛(𝑗)+𝑊𝜏(𝑗)+𝐶_𝑗=𝑙_𝑛(𝑘), then

       𝑟_𝑛(𝑗)+𝑊𝜏(𝑗)−𝑙_𝑛(𝑘)=𝐶_𝑗 therefore the final job will be 𝐶_𝑗

        else 𝑟_𝑛(𝑗)+𝑊𝜏(𝑗)+𝐶_𝑗>𝑙_𝑛(𝑘), then

            𝑟_𝑛(𝑗)+𝑊𝜏(𝑗)+𝐶_𝑗−𝑙_𝑛(𝑘)=𝐶>0;

        if 𝑊𝜏(𝑗)+𝐶_𝑗−𝐶≥𝐶_𝑗 then, final job will be 𝐶_𝑗

          else final job is 𝐶𝑠_𝑗=𝑊𝜏(𝑗)+𝐶_𝑗−𝐶