Max Stenmark's scientific contributions

Publication (1)

Conference Paper
Full-text available
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...


... Suppose a sort algorithm operates on fixed-size items, which are either keys or key-value pairs, depending on the application. The following notation will be useful for the rest of the discussion: N : Number of items to sort C: Number of items fitting into L2 cache (typically 2 16 − 2 18 ) T : Number of threads (typically double the core count) W: Number of items per SIMD register (typically [4][5][6][7][8][9][10][11][12][13][14][15][16] R: Number of SIMD registers per core (typically 16 or 32) B: Size of each item in bits (typically 32, 64, or 128) ...