This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Implementation and Analysis of Path History in Dynamic Branch Prediction Schemes
August 1998 (vol. 47 no. 8)
pp. 907-912

Abstract—Accurate branch prediction is essential for providing higher performance levels in modern processors. Many branch predictors use branch execution history to identify repetitive branch behavior. Path history provides additional information that may help separate sequences of different branch instructions with identical execution history. We present a method to implement path history in hardware-based branch prediction, and a comprehensive simulation study of branch prediction strategies that integrate path history.

[1] Atom User Manual. Digital Equipment Corp., 1994.
[2] S. McFarling, "Combining Branch Predictors," Technical Report WRL Technical Note TN-36, Digital Equipment Corp., June 1993.
[3] P. Michaud, A. Seznec, and R. Uhlig, “Trading Conflict and Capacity Aliasing in Conditional Branch Predictors,” Proc. 24th Ann. Int'l Symp. Computer Architecture, pp. 292-303, June 1997.
[4] R. Nair, “Dynamic Path-Based Branch Correlation,” Proc Int'l Symp. Microarchitecture, pp. 15-23, 1995.
[5] S. Pan, K. So, and J. Rahmeh, “Improving the Accuracy of Dynamic Branch Prediction Using Branch Correlation,” Proc. Fifth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 76-84, Oct. 1992.
[6] S. Sechrest, C.-C. Lee, and T. Mudge, “Correlation and Aliasing in Dynamic Branch Predictors,” Proc. 23rd Ann. Int'l Symp. Computer Architecture, pp. 22-32, May 1995.
[7] E. Sprangle, R.S. Chappell, M. Alsup, and Y.N. Patt, “The Agree Predictor: A Mechanism for Reducing Negative Branch History Interference,” Proc. 24th Annual Int'l Symp. Computer Architecture, pp. 284-291, June 1997.
[8] T.-Y. Yeh and Y. Patt, “A Comparison of Dynamic Branch Predictors that Use Two Levels of Branch History,” Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 257-266, May 1993.
[9] C. Young, N. Gloy, and M. Smith, “A Comparative Analysis of Schemes for Correlated Branch Prediction,” Proc. 22nd Ann. Int'l Symp. Computer Architecture, May 1995.
[10] C. Young and M. Smith, “Improving the Accuracy of Static Branch Prediction Using Branch Correlation,” Proc. Sixth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 232-241, Oct. 1994.

Index Terms:
Branch prediction, speculative execution, path history, branch history.
Citation:
Shlomo Reches, Shlomo Weiss, "Implementation and Analysis of Path History in Dynamic Branch Prediction Schemes," IEEE Transactions on Computers, vol. 47, no. 8, pp. 907-912, Aug. 1998, doi:10.1109/12.707596
Usage of this product signifies your acceptance of the Terms of Use.