A survey of techniques for dynamic branch prediction
Author:
- 2 September 2018
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 31 (1)
Abstract
Summary: Branch predictor (BP) is an essential component in modern processors since high BP accuracy can improve performance and reduce energy by decreasing the number of instructions executed on wrong‐path. However, reducing the latency and storage overhead of BP while maintaining high accuracy presents significant challenges. In this paper, we present a survey of dynamic branch prediction techniques. We classify the works based on key features to underscore their differences and similarities. We believe this paper will spark further research in this area and will be useful for computer architects, processor designers, and researchers.Keywords
All Related Versions
Funding Information
- Intel Corporation
This publication has 68 references indexed in Scilit:
- Merging path and gshare indexing in perceptron branch predictionACM Transactions on Architecture and Code Optimization, 2005
- Piecewise Linear Branch PredictionACM SIGARCH Computer Architecture News, 2005
- Power-aware branch prediction: characterization and designIEEE Transactions on Computers, 2004
- Prophet/Critic Hybrid Branch PredictionACM SIGARCH Computer Architecture News, 2004
- Two-level branch prediction using neural networksJournal of Systems Architecture, 2003
- Neural methods for dynamic branch predictionACM Transactions on Computer Systems, 2002
- Dynamic history-length fittingACM SIGARCH Computer Architecture News, 1998
- An analysis of correlation and predictabilityACM SIGARCH Computer Architecture News, 1998
- Analysis of branch prediction via data compressionACM SIGPLAN Notices, 1996
- A case for two-way skewed-associative cachesACM SIGARCH Computer Architecture News, 1993