Correlating Predictor Problem.

The following trace represents the actual outcome of a single branch instruction for a certain program. (a) (10 pts) Fill in the table showing updated predictions and hits/misses for a l bit and 2 bit non-correlating predictors. The default predictions are given below. Trace Default T T F F T F T F F T F 1-bit T hit/miss (b) (10 pts) The following trace was generated for a program in which you want to evaluate a (1,1) branch prediction scheme. The program loops such that the branches are executed in order and continue repeating (i.e., br1 br2 br3 bl br2... The default prediction value NT/NT for the first branch implies a prior branch was not taken. Fill in the Table below. 1 2 3 4 Brl T T T F Br2 TFT F Br3 FTFT Branch 1 Branch 2 Branch 3 Pred Actual Pred Actual Pred Actual N TNT NT/NT The following trace represents the actual outcome of a single branch instruction for a certain program. (a) (10 pts) Fill in the table showing updated predictions and hits/misses for a l bit and 2 bit non-correlating predictors. The default predictions are given below. Trace Default T T F F T F T F F T F 1-bit T hit/miss (b) (10 pts) The following trace was generated for a program in which you want to evaluate a (1,1) branch prediction scheme. The program loops such that the branches are executed in order and continue repeating (i.e., br1 br2 br3 bl br2... The default prediction value NT/NT for the first branch implies a prior branch was not taken. Fill in the Table below. 1 2 3 4 Brl T T T F Br2 TFT F Br3 FTFT Branch 1 Branch 2 Branch 3 Pred Actual Pred Actual Pred Actual N TNT NT/NT