Timely, Efficient, and Accurate Branch Precomputation
Aniket Deshmukh, Lingzhe Chester Cai, Yale N. Patt
Abstract
Out-of-order cores rely on high-accuracy branch predictors to supply useful instructions to the processor backend. However, there remains a large fraction of mispredictions caused by hard-to-predict (H2P) branches that modern predictors have been unable to improve. Precomputation is an alternative to prediction that speculatively executes the dependence chain of a branch earlier to override the branch predictor at Fetch time. However, prior work sacrifices H2P branch coverage and precomputation accuracy to produce timely results.
Our work relaxes this timeliness constraint by using precomputation results to issue early misprediction flushes instead of overriding the branch predictor. This allows us to construct a highly accurate precomputation thread with good misprediction coverage, without sacrificing timeliness. The thread is efficient as it utilizes on-core execution resources and re-uses existing hardware for issuing early flushes. Using our Timely, Efficient, and Accurate thread for precomputation yields a 10.1% improvement in performance over an aggressive baseline OoO core.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 63e9eb9b-21cd-4b81-810e-2f1f2c645247Cited by top-tier papers2
- Enabling Ahead Prediction with Practical Energy ConstraintsLingzhe Chester Cai, Aniket Deshmukh, Yale N. PattISCA 2025 · 2 citations
- Harvesting Sub-Microsecond CXL Memory Stalls with LiteSwitchNanqinqin Li, Yuhong Zhong, Asaf Cidon, Michael J. FreedmanOSDI 2026
Builds on5
- BranchNet: A Convolutional Neural Network to Predict Hard-To-Predict BranchesSiavash Zangeneh, Stephen Pruett, Sangkug Lym, Yale N. PattMICRO 2020 · 50 citations
- CRISP: critical slice prefetchingHeiner Litz, Grant Ayers, Parthasarathy RanganathanASPLOS 2022 · 33 citations
- Branch Runahead: An Alternative to Branch Prediction for Impossible to Predict BranchesStephen Pruett, Yale N. PattMICRO 2021 · 23 citations
- Slipstream Processors Revisited: Exploiting Branch SetsVinesh Srinivasan, Rangeen Basu Roy Chowdhury, Eric RotenbergISCA 2020 · 12 citations
- Criticality Driven FetchAniket Deshmukh, Yale N. PattMICRO 2021 · 9 citations
Related papers
- Alternate Path FetchAniket Deshmukh, Lingzhe Chester Cai, Yale N. PattISCA 2024 · 2 citations
- Auto-Predication of Critical BranchesAdarsh Chauhan, Jayesh Gaur, Zeev Sperber, Franck Sala et al.ISCA 2020 · 8 citations
- Delinquent Loop Pre-execution Using Predicated Helper ThreadsAnirudh Seshadri, Eric RotenbergHPCA 2025 · 1 citation
- Focused Value PredictionSumeet Bandishte, Jayesh Gaur, Zeev Sperber, Lihu Rappoport et al.ISCA 2020 · 13 citations
- Vector RunaheadAjeya Naithani, Sam Ainsworth, Timothy M. Jones, Lieven EeckhoutISCA 2021 · 27 citations
