A study of branch prediction strategies

  • Authors:
  • James E. Smith

  • Affiliations:
  • -

  • Venue:
  • ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
  • Year:
  • 1981

Quantified Score

Hi-index 0.05

Visualization

Abstract

In high-performance computer systems, performance losses due to conditional branch instructions can be minimized by predicting a branch outcome and fetching, decoding, and/or issuing subsequent instructions before the actual outcome is known. This paper discusses branch prediction strategies with the goal of maximizing prediction accuracy. First, currently used techniques are discussed and analyzed using instruction trace data. Then, new techniques are proposed and are shown to provide greater accuracy and more flexibility at low cost.