Practice Branch Prediction (4.3) - Branches and Limits to Pipelining

Practise this section

11 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
5 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is static branch prediction?
Show hintHide hint
Think about its basic nature.
Question 2.
Name one benefit of dynamic branch prediction.
Show hintHide hint
Consider learning from past behavior.
3Question 3.
What is the primary purpose of branch prediction?
- To improve memory speed
- To minimize control hazards
- To increase power consumption
Show hintHide hint
Consider why delays occur in processing.
4Question 4.
True or False: Static branch prediction can adapt to changing program behavior.
- True
- False
Show hintHide hint
Reflect on its fixed nature.
Question 5.
Given a loop structure that frequently changes based on user input, evaluate the effectiveness of static vs dynamic branch prediction.
Show hintHide hint
Analyze the changing nature of input and how predictions need to adjust.
Question 6.
Consider a scenario where function calls are nested deeply. Discuss how the Return Address Stack aids performance and its potential limitations.
Show hintHide hint
Connect the idea of depth to how the stack manages addresses.

7 more questions in this section. Enroll free to practise them all.