Branch mispredictions don't affect mergesort

  • Authors:

  • Amr Elmasry;Jyrki Katajainen;Max Stenmark

  • Affiliations:

  • Department of Computer Science, University of Copenhagen, Copenhagen East, Denmark;Department of Computer Science, University of Copenhagen, Copenhagen East, Denmark,Jyrki Katajainen and Company, Copenhagen North, Denmark;Jyrki Katajainen and Company, Copenhagen North, Denmark

  • Venue:
  • SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In quicksort, due to branch mispredictions, a skewed pivot-selection strategy can lead to a better performance than the exact-median pivot-selection strategy, even if the exact median is given for free. In this paper we investigate the effect of branch mispredictions on the behaviour of mergesort. By decoupling element comparisons from branches, we can avoid most negative effects caused by branch mispredictions. When sorting a sequence of n elements, our fastest version of mergesort performs n log2n+O(n) element comparisons and induces at most O(n) branch mispredictions. We also describe an in-situ version of mergesort that provides the same bounds, but uses only O(log2n) words of extra memory. In our test computers, when sorting integer data, mergesort was the fastest sorting method, then came quicksort, and in-situ mergesort was the slowest of the three. We did a similar kind of decoupling for quicksort, but the transformation made it slower.