Yeh's dynamic branch prediction algorithm, used on the Pentium 4, is a two-level branch prediction algorithm. The
Question:
a. In testing the performance of this scheme, Yeh tried five different prediction schemes, illustrated in Figure 14.16. Identify which three of these schemes correspond to those shown in Figures 12.19 and 12.28. Describe the remaining two schemes.
b. With this algorithm, the prediction is not based on just the recent history of this particular branch instruction. Rather, it is based on the recent history of all patterns of branches that match the n-bit pattern in the BHT entry for this instruction. Suggest a rationale for such a strategy.
Figure 14.16 Figure for Problem 14.8
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Computer organization and architecture designing for performance
ISBN: 978-0136073734
8th edition
Authors: william stallings
Question Posted: