Design of a Hybrid Branch Prediction Architecture for Risc-V Processors

Branch prediction is critical for performance in modern high-speed processors, whereas branch prediction error results in pipeline flush and execution stalls. This paper presents a hybrid branch prediction architecture that combines global and local history predictors to improve accuracy in a 32-bit dual-issue superscalar processor. The design integrates a global history Gshare predictor and a local two-level adaptive predictor using a tournament-style selection mechanism. We address practical implementation issues, including concurrent prediction of multiple branches per fetch bundle and a speculative update strategy for predictor state. The proposed hybrid predictor was implemented and evaluated on industry-standard benchmarks. On the CoreMark benchmark, the hybrid predictor achieves a score of 3.128 CoreMark/MHz with a MPKI(Missed Predictions per Kilo Instruction) as low as <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{1 4. 3 7 3}$</tex> and a prediction accuracy of 93.09 %, about 5 percentage points higher than a baseline bimodal predictor. These results demonstrate that combining global and local prediction techniques can significantly reduce prediction error rate and improve overall processor performance.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/icccas65806.2025.11102589
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of a Hybrid Branch Prediction Architecture for Risc-V Processors

Xige Zhang, Xianzhe Fan, Shuo Zhao, Zhihua Wang et al.
1 links
Parallel Computing and Optimization Techniques
article

Design of a Hybrid Branch Prediction Architecture for Risc-V Processors

Xige Zhang, Xianzhe Fan, Shuo Zhao, Zhihua Wang, Dejian Li, Jiahui Zhou
article en

Abstract

Branch prediction is critical for performance in modern high-speed processors, whereas branch prediction error results in pipeline flush and execution stalls. This paper presents a hybrid branch prediction architecture that combines global and local history predictors to improve accuracy in a 32-bit dual-issue superscalar processor. The design integrates a global history Gshare predictor and a local two-level adaptive predictor using a tournament-style selection mechanism. We address practical implementation issues, including concurrent prediction of multiple branches per fetch bundle and a speculative update strategy for predictor state. The proposed hybrid predictor was implemented and evaluated on industry-standard benchmarks. On the CoreMark benchmark, the hybrid predictor achieves a score of 3.128 CoreMark/MHz with a MPKI(Missed Predictions per Kilo Instruction) as low as <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{1 4. 3 7 3}$</tex> and a prediction accuracy of 93.09 %, about 5 percentage points higher than a baseline bimodal predictor. These results demonstrate that combining global and local prediction techniques can significantly reduce prediction error rate and improve overall processor performance.

Beijing Microelectronics Technology Institute (CN), Tsinghua University (CN)
Openalex Percentile: Top 78%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.