Filtering of unnecessary branch predictor lookups for low-power processor architecture

Wei Hau Chiao*, Chung-Ping Chung

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Efforts to reduce power consumption of processors have gained much attention recently. Dynamic branch predictor, including BTB, is exercised in every instruction cycle, yet branch instructions only constitute a small percentage of instructions during program execution. This study proposes a novel method to collect the next branch distances of the recent branch instructions at runtime, in order to eliminate unnecessary branch predictor lookups. Simulation results show that the proposed design reduces the energy consumption in the dynamic branch predictor by an average of 56.95% without performance degradation. The proposed method is fully compatible with BPP and SEPAS, and saves more energy than PPD, Lazy BTB, and EIB does.

Original languageEnglish
Pages (from-to)1127-1142
Number of pages16
JournalJournal of Information Science and Engineering
Volume24
Issue number4
DOIs
StatePublished - 1 Jul 2008

Keywords

  • Branch prediction
  • BTB
  • Lookup filtering
  • Low power
  • Pipelined processor

Fingerprint Dive into the research topics of 'Filtering of unnecessary branch predictor lookups for low-power processor architecture'. Together they form a unique fingerprint.

Cite this