Consider the 4?bit saturating counter as a branch predictor with 16 states from 1111 to 0000? Describe in words the circumstances where such a counter might be effective.
What will be an ideal response?
If the branch predictor works in the same way as a 2?bit saturating counter, it has 16 states; 8 of which predict
take and 8 don’t take the branch. If you are in a run of taken or not taken branches (more than 15) then you are in
the strongest taken (or not taken state). It will take a run of eight wrongly predicted branches in sequence to
reverse the decision. Therefore, you might use such a system in circumstances where very longs runs of a branch
are in one direction, and you do not wish to reverse the direction unless there is a change of direction spanning 8
branches.
You might also like to view...
A(n) ________ is a message sent back to inform the email sender that you have opened, and presumably read, the message
Fill in the blank(s) with correct word
Match the following nonprinting symbol description with how it is created:
I. nonbreaking space A. press Enter II. line break B. press Shift+Enter III. end of paragraph C. press Ctrl+Shift+Spacebar IV. regular hyphen D. press Ctrl+Shift+Hyphen V. nonbreaking hyphen E. press Hyphen