Dynamic history-length fitting
Authors:
Open Access
- 16 April 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 26 (3) , 155-166
Abstract
Accurate branch prediction is essential for obtaining high performance in pipelined superscalar processors that execute instructions speculatively. Some of the best current predictors combine a part of the branch address with a fixed amount of global history of branch outcomes in order to make a prediction. These predictors cannot perform uniformly well across all workloads because the best amount of history to be used depends on the code, the input data and the frequency of context switches. Consequently, all predictors that use a fixed history length are therefore unable to perform up to their maximum potential.We introduce a method---called DHLF---that dynamically determines the optimum history length during execution, adapting to the specific requirements of any code, input data and system workload. Our proposal adds an extra level of adaptivity to two-level adaptive branch predictors. The DHLF method can be applied to any one of the predictors that combine global branch history with the branch address. We apply the DHLF method to gshare ( dhlf-gshare ) and obtain near-optimal results for all SPECint95 benchmarks, with and without context switches. Some results are also presented for gskewed ( dhlf-gskewed ), confirming that other predictors can benefit from our proposal.Keywords
This publication has 10 references indexed in Scilit:
- The agree predictor1997
- Trading conflict and capacity aliasing in conditional branch predictors1997
- Using hybrid branch predictors to improve branch prediction accuracy in the presence of context switches1996
- Correlation and aliasing in dynamic branch predictors1996
- The Mips R10000 superscalar microprocessorIEEE Micro, 1996
- Branch classification1994
- A comparison of dynamic branch predictors that use two levels of branch history1993
- Improving the accuracy of dynamic branch prediction using branch correlation1992
- Alternative implementations of two-level adaptive branch prediction1992
- Two-level adaptive training branch prediction1991