One-Two Bit Branch Prediction
What is the primary function of a branch predictor in a CPU pipeline?
How does a one-bit branch predictor make its prediction?
What are the two states of a one-bit branch predictor?
What is the main limitation of a one-bit branch predictor, especially in a loop?
How many bits does a two-bit saturating counter use for prediction?
In a two-bit predictor, which state transition occurs when a branch is in the 'Strongly Taken' (11) state and the branch is not taken?
Why is a two-bit predictor generally more accurate than a one-bit predictor?
Consider a two-bit predictor in the 'Weakly Not Taken' (01) state. What happens if the next two branches are taken?
Which of the following sequences of branch outcomes would result in the highest accuracy for a one-bit predictor, starting in the 'Not Taken' state?