Advanced Computer Architecture, Imperial College 2001
17
Some dynamic applications have highly-correlated branches
•For “go”, optimum BHR size (m) is much larger
Text Box: Zhendong Su and Min Zhou, A comparative analysis of branch prediction schemes (http://www.cs.berkeley.edu/~zhendong/cs252/project.html)
Zhendong Su and Min Zhou, A comparative analysis of branch prediction schemes
(http://www.cs.berkeley.edu/~zhendong/cs252/project.html)