Consider four branch prediction schemes: predict not taken, predict taken, 1-bit and 2-bit dynamic prediction. Assume...

Transcribed Image Text:

Consider four branch prediction schemes: predict not taken, predict taken, 1-bit and 2-bit dynamic prediction. Assume that they all have zero penalty when they predict correctly and two cycles when they predict incorrectly. What will be the accuracy of all four types of branch schemes for the following code? Int k = 0; for (i=0; i<100; i++) { for (j=0; j<3; j++) k++; } Equivalent assembly code is main: li St2, 100 #i = 100 li $t3, 0 #k = 0 outer_Loop: li St1,3 #j= 3 inner_Loop: add St3, $t3, 1 #k k+1 subi St1, St1,1 #j= j-1 bne St1,0, inner_Loop subi $t2, $t2,1 #i=i-1 bne $t2,0, outer_Loop ## End of assembly code is Consider four branch prediction schemes: predict not taken, predict taken, 1-bit and 2-bit dynamic prediction. Assume that they all have zero penalty when they predict correctly and two cycles when they predict incorrectly. What will be the accuracy of all four types of branch schemes for the following code? Int k = 0; for (i=0; i<100; i++) { for (j=0; j<3; j++) k++; } Equivalent assembly code is main: li St2, 100 #i = 100 li $t3, 0 #k = 0 outer_Loop: li St1,3 #j= 3 inner_Loop: add St3, $t3, 1 #k k+1 subi St1, St1,1 #j= j-1 bne St1,0, inner_Loop subi $t2, $t2,1 #i=i-1 bne $t2,0, outer_Loop ## End of assembly code is

Answer rating: 100% (QA)

The ID stage of clock cycle 3 determines that a branch must be t... View the full answer