Good predictions are worth a few comparisons - Archive ouverte HAL Access content directly
Conference Papers Year :

Good predictions are worth a few comparisons


Most modern processors are heavily parallelized and use predictors to guess the outcome of conditional branches, in order to avoid costly stalls in their pipelines. We propose predictor-friendly versions of two classical algorithms: exponentiation by squaring and binary search in a sorted array. These variants result in less mispredictions on average, at the cost of an increased number of operations. These theoretical results are supported by experimentations that show that our algorithms perform significantly better than the standard ones, for primitive data types. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
Fichier principal
Vignette du fichier
aunipi2016-branch-predictions.pdf (1.91 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01212840 , version 1 (07-10-2015)



Nicolas Auger, Cyril Nicaud, Carine Pivoteau. Good predictions are worth a few comparisons. STACS 2016, Feb 2016, Orléans, France. pp.12:1-12:14, ⟨10.4230/LIPIcs.STACS.2016.12⟩. ⟨hal-01212840⟩
350 View
430 Download



Gmail Facebook Twitter LinkedIn More