Latest revision as of 21:03, 28 January 2021

Abstract

path confidence estimate indicates the likelihood that the processor is currently fetching correct path instructions. Accurate path confidence prediction is critical for applications like pipeline gating and confidence-based SMT fetch prioritization. Previous work in this domain uses a threshold-and-count predictor, where the number of unresolved, low-confidence branches serves as an estimate of path confidence. This approach is inaccurate since it implicitly assumes that all low-confidence branches have the same mispredict rate, and that high-confidence branches never mispredict. We propose an alternative path confidence predictor designed from first principles, called PaCo, that directly estimates the probability that the processor is on the goodpath, and considers contributions from all branches, both high and low confidence. Even though it uses only modest hardware, PaCo can estimate the processorpsilas goodpath likelihood with very high accuracy, with an RMS error of 3.8%. We show that PaCo significantly outperforms threshold-and-count predictors in pipeline gating and SMT fetch prioritization. In pipeline gating, while the best conventional predictor can reduce badpath instructions executed by 7% with a small loss in performance, PaCo can reduce bad-path instructions by 32% without any performance loss. In SMT fetch prioritization, using PaCo instead of conventional path confidence predictors improves performance by up to 23%, and 5.5% on average.

Original document

The different versions of the original document can be found in:

• https://www.ideals.illinois.edu/bitstream/2142/74601/2/B59-CRHC_07_08.pdf

• http://xplorestaging.ieee.org/ielx5/4653641/4658618/04658627.pdf?arnumber=4658627,

http://dx.doi.org/10.1109/hpca.2008.4658627

• https://dblp.uni-trier.de/db/conf/hpca/hpca2008.html#MalikADF08,

http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004658627,

https://ieeexplore.ieee.org/document/4658627,

https://www.ideals.illinois.edu/handle/2142/74601,

https://academic.microsoft.com/#/detail/2108498195