Steps involved in DTMR algorithm

Step 1:

Step 2:

Step 3:

Step 4:

Step 5:

Step 6:

Step 7:

Step 8:

Step 9:

Step 10:

Step 11:

Step 12:

Step 13:

Initialize DTMR

Find all possible paths $P\in P_p$

For each $P\in P_p$

Find Delay_p

Fid HC

Compute CF_p

If (CF_p==Small)

Select as optimal path

Else

Goto step3

End if

End for

End