A comparative analysis of schemes for correlated branch prediction

  • Authors:

  • Cliff Young;Nicolas Gloy;Michael D. Smith

  • Affiliations:

  • Division of Applied Sciences, Harvard University, Cambridge, MA;Division of Applied Sciences, Harvard University, Cambridge, MA;Division of Applied Sciences, Harvard University, Cambridge, MA

  • Venue:
  • ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
  • Year:
  • 1995

Quantified Score

Hi-index 0.02

Visualization

Abstract

Modern high-performance architectures require extremely accurate branch prediction to overcome the performance limitations of conditional branches. We present a framework that categorizes branch prediction schemes by the way in which they partition dynamic branches and by the kind of predictor that they use. The framework allows us to compare and contrast branch prediction schemes, and to analyze why they work. We use the framework to show how a static correlated branch prediction scheme increases branch bias and thus improves overall branch prediction accuracy. We also use the framework to identify the fundamental differences between static and dynamic correlated branch prediction schemes. This study shows that there is room to improve the prediction accuracy of existing branch prediction schemes.