Answer all three parts correct and with full steps.
Otherwise do not attempt!!
These problems assume that we are using a processor with a 15-stage pipeline and that the actual direction (T or NT) for a branch is resolved in the 10th stage. The processor is executing a program, which 10% of executed instructions are conditional branches, and the only stalls occur when the direction of a conditional branch is mis-predicted. The accuracies of the different a predictors for this program are as follows: Always-Taken 45% Always-Not-Taken 55% 2-bit 90% Global 95% Tournament 98%
8. For the Tournament branch predictor, what speedup would be achieved if we apply a program transformation to half of the branch instructions replacing them with an add instruction? 9. For the 2-Bit predictor, what speedup would be achieved if we apply a transformation to half of the branch instructions replacing them with two add instructions? 10. For the Global predictor, what speedup would be achieved if we apply a transformation to half of the branch instructions replacing them with two add instructions?
Answer all three parts correct and with full steps. Otherwise do not attempt!!
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am