Assume a program core consisting of five conditional branches. The program core will be executed millions of times. Below are the outcomes of each branch for one execution of the program core (T for taken and N for not taken). Branch 1: T-T-T-T-T Branch 2: N-N-N Branch 3: T-N-T-N-T-N-T-N Branch 4: T-T-T-N-N-N Branch 5: T-T-T-N-T-T-T-N-T Assume that behaviour of each branch remains the same for each program core execution. For dynamic branch prediction schemes, assume that each branch has its own prediction buffer and each buffer is initialized to the same state before each execution. List the predictions and the accuracies for each of the following branch prediction schemes: i) Always taken ii) Always not taken iii) 1-bit predictor, initialized to predict taken iv) 2-bit predictor, initialized to weakly predict tak
Assume a
will be executed millions of times. Below are the outcomes of each branch for one
execution of the program core (T for taken and N for not taken).
Branch 1: T-T-T-T-T
Branch 2: N-N-N
Branch 3: T-N-T-N-T-N-T-N
Branch 4: T-T-T-N-N-N
Branch 5: T-T-T-N-T-T-T-N-T
Assume that behaviour of each branch remains the same for each program core
execution. For dynamic branch prediction schemes, assume that each branch has
its own prediction buffer and each buffer is initialized to the same state before each
execution. List the predictions and the accuracies for each of the following branch
prediction schemes:
i) Always taken ii) Always not taken iii) 1-bit predictor, initialized to predict
taken iv) 2-bit predictor, initialized to weakly predict taken
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
