Branch mispredictions in large graph processing programs can be mitigated by optimizing existing branch predictors to better handle recurring branch types.
Jimenez and Calvin Lin, ”Neural Methods for Dynamic Branch Prediction,” ACM Transactions on Computer Systems, Nov
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimizing Branch Predictor for Graph Applications
Branch mispredictions in large graph processing programs can be mitigated by optimizing existing branch predictors to better handle recurring branch types.