Reducing branch predictor leakage energy by exploiting loops

  • Authors:
  • Wei Zhang;Bramha Allu

  • Affiliations:
  • Southern Illinois University Carbondale, Carbondale, Illinois;Southern Illinois University Carbondale, Carbondale, Illinois

  • Venue:
  • ACM Transactions on Embedded Computing Systems (TECS) - SPECIAL ISSUE SCOPES 2005
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the scaling of technology, leakage energy will become the dominant source of energy consumption. Besides cache memories, branch predictors are among the largest on-chip array structures and consume nontrivial leakage energy. This paper proposes two cost-effective loop-based strategies to reduce the branch predictor leakage without impacting prediction accuracy or performance. The loop-based approaches exploit the fact that loops usually only contain a small number of instructions and, hence, even fewer branch instructions while taking a significant fraction of the execution time. Consequently, all the nonactive entries of branch predictors can be placed into the low leakage mode during the loop execution in order to reduce leakage energy. Compiler and circuit supports are discussed to implement the proposed leakage-reduction strategies. Compared to the recently proposed decay-based approach, our experimental results show that the loop-based approach can extract 16.2% more dead time of the branch predictor, on average, leading to more leakage energy savings without impacting the branch prediction accuracy and performance.