Question

For the following code, answer the questions below.
{            for (i=0; i < 6; i++)
               {           do something}
}
In predicting the branch terminating the inner loop (located at the end of the loop), answer the prediction success rate with the following schemes. Assume 0 for NOT-TAKEN and 1 for TAKEN.

Question)) A prediction table of two-bit saturating counters (initial value = 00) indexed by PC

Answer 1

Answer Predictors' table format Depend on the previous branch istaken or nottaken Predicate PC only taken the Predictions Prediction Prediction |Prediction if last bits if last branch branch T Not Taken NT NT/T T/NT T/T NT NT

2 bit branch update table table update NT 0x400100 addir10 r0.6 0x400104 addirl.rl.r0 0x400108 L1: FSM update the logic redicate Actual outcome lbgic value NT 0x400A04 addirl111 0x400A08 bner1.r10L1 For each and every branch maintain the 2 bit saturating counter I the branch value is taken than the counter value is min (3.counter+1) If the branch is not taken counter-max(0,counter-1)

If(counter>-2)means such that prediction is taken or nottaken Prediction 01 is the prediction values