Optimal 2-bit branch predictors
- 1 May 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 44 (5), 698-702
- https://doi.org/10.1109/12.381956
Abstract
This paper presents an efficient technique to analyze finite-state machines to determine an optimal one for branch prediction. It also presents results from using this technique to determine optimal 4-state branch predictors for applications in the SPECS9 benchmark suite running on the IBM RS/6000. The paper concludes that the simple 2-bit counter is the only machine that performs consistently well and close to the optimal over all applications.<>Keywords
This publication has 9 references indexed in Scilit:
- Alternative Implementations of Two-Level Adaptive Branch PredictionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Comparison Of Dynamic Branch Predictors That Use Two Levels Of Branch HistoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A study of branch prediction strategiesPublished by Association for Computing Machinery (ACM) ,1998
- Improving the accuracy of dynamic branch prediction using branch correlationPublished by Association for Computing Machinery (ACM) ,1992
- Two-level adaptive training branch predictionPublished by Association for Computing Machinery (ACM) ,1991
- Machine organization of the IBM RISC System/6000 processorIBM Journal of Research and Development, 1990
- Reducing the branch penalty in pipelined processorsComputer, 1988
- Reducing the cost of branchesACM SIGARCH Computer Architecture News, 1986
- Branch Prediction Strategies and Branch Target Buffer DesignComputer, 1984