| next > | ©2001 Harald Bögeholz |
Global history is interesting because the outcome of some branches depends on the outcome of other branches executed previously.
(Imagine a good example here.)
It also takes less memory to implement: Only a single shift register and a single table is needed, bringing the total for a b-bit global history predictor with n-bit counters to b + 2b × n.