The Community for Technology Leaders
Computer Architecture, International Symposium on (2005)
Madison, Wisconsin
June 4, 2005 to June 8, 2005
ISSN: 1063-6897
ISBN: 0-7695-2270-X
pp: 394-405
<p>In this paper, we introduce and analyze the Optimized GEometric History Length (O-GEHL) branch Predictor that efficiently exploits very long global histories in the 100-200 bits range.</p> <p>The GEHL predictor features several predictor tables T(i) (e.g. 8) indexed through independent functions of the global branch history and branch address. The set of used global history lengths forms a geometric series, i.e., L(j) = \alpha ^{i - 1} L(1). This allows the GEHL predictor to efficiently capture correlation on recent branch outcomes as well as on very old branches. As on perceptron predictors, the prediction is computed through the addition of the predictions read on the predictor tables.</p> <p>The O-GEHL predictor further improves the ability of the GEHL predictor to exploit very long histories through the addition of dynamic history fitting and dynamic threshold fitting.</p> <p>The O-GEHL predictor can be ahead pipelined to provide in time predictions on every cycle.</p>
André Seznec, "Analysis of the O-GEometric History Length Branch Predictor", Computer Architecture, International Symposium on, vol. 00, no. , pp. 394-405, 2005, doi:10.1109/ISCA.2005.13
93 ms
(Ver 3.3 (11022016))