Unbiased Branches: An Open Problem

10 years 9 months ago
Unbiased Branches: An Open Problem
The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but they do not consider the impact of unbiased branches, which are difficult-to-predict. In this paper, we evaluate the impact of unbiased branches in terms of prediction accuracy on a range of branch difference predictors using prediction by partial matching, multiple Markov prediction and neural-based prediction. Since our focus is on the impact that unbiased branches have on processor performance, timing issues and hardware costs are out of scope of this investigation. Our simulation results, with the SPEC2000 integer benchmark suite, are interesting even though they show that unbiased branches still restrict the ceiling of branch prediction and therefore accurately predicting unbiased branches remains an open problem.
Arpad Gellert, Adrian Florea, Maria Vintan, Colin
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Authors Arpad Gellert, Adrian Florea, Maria Vintan, Colin Egan, Lucian N. Vintan
Comments (0)