Novel branch prediction strategy based on adaptive history length for high-performance microprocessor

Sang Hoon Lee, Jongsu Park

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


The demands for high-performance microprocessors have recently increased. Accurate branch prediction is one of the most important factors for high-performance processors. In order to predict branch outcomes, instruction program counter bits and the history of recently executed branch outcomes are used. Among the executed branch outcomes, some histories are useful while others are useless. In addition, these useful/useless histories vary among branch instructions. Numerous studies have shown a method that identifies optimal history. However, little research has been done regarding the treatment of useless history. In this paper, a new method called Instruction Address alloyed History Length Modification branch predictor is proposed to handle the useless history bits. When PHT entries are 4,096, IAaHLM has a prediction accuracy of 93.22% and Gshare has a prediction accuracy of 91.84%.

Original languageEnglish
Article number43
Pages (from-to)341-349
Number of pages9
JournalWSEAS Transactions on Systems and Control
Publication statusPublished - 2019

Bibliographical note

Publisher Copyright:
© 2019, World Scientific and Engineering Academy and Society. All rights reserved.

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Control and Optimization


Dive into the research topics of 'Novel branch prediction strategy based on adaptive history length for high-performance microprocessor'. Together they form a unique fingerprint.

Cite this