CMA-BP: A Clustered Multi-Task Learning and Branch Attention Based Branch Predictor

Branch prediction stands as a key bottleneck in enhancing CPU performance, particularly evidenced by an average of around 10 mispredicted hard-to-predict(H2P) branches per benchmark in SPEC 2017 by current neural network methods. To improve, this paper proposed a Clustered Multi-task Learning and Branch Attention Mechanism-Based Branch Predictor (CMA-BP). Clustered multi-task learning enhances model generalization, and branch attention extracts preferences of different branches for global history. Thus, CMA-BP efficiently aggregates branches with similar features, reducing training complexity. Experimental results show that CMA-BP outperforms existing predictors in accuracy significantly and in the number of parameters required. By advancing the state-of-the-art in branch prediction, this work has important implications for future high-performance computer architecture design

Authors

Institutions

Publication Details

Published
2024-10-06
DOI
https://doi.org/10.1109/smc54092.2024.10831163
Citations
1
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CMA-BP: A Clustered Multi-Task Learning and Branch Attention Based Branch Predictor

Rucong Xu, Ming Li, Lin Li, Haowei Zhang et al.
1 citations
Neural Networks and Applications
0.35
article

CMA-BP: A Clustered Multi-Task Learning and Branch Attention Based Branch Predictor

Rucong Xu, Ming Li, Lin Li, Haowei Zhang, Yun Li
article en
1 citations

Abstract

Branch prediction stands as a key bottleneck in enhancing CPU performance, particularly evidenced by an average of around 10 mispredicted hard-to-predict(H2P) branches per benchmark in SPEC 2017 by current neural network methods. To improve, this paper proposed a Clustered Multi-task Learning and Branch Attention Mechanism-Based Branch Predictor (CMA-BP). Clustered multi-task learning enhances model generalization, and branch attention extracts preferences of different branches for global history. Thus, CMA-BP efficiently aggregates branches with similar features, reducing training complexity. Experimental results show that CMA-BP outperforms existing predictors in accuracy significantly and in the number of parameters required. By advancing the state-of-the-art in branch prediction, this work has important implications for future high-performance computer architecture design

Qingdao Agricultural University (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 30%
Neural Networks and Applications
0.35
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.