Max Stenmark's scientific contributions

What is this page?
This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.

It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.

If you're a ResearchGate member, you can follow this page to keep up with this author's work.

If you are this author, and you don't want us to display this page anymore, please let us know.

Publication (1)

Branch Mispredictions Don’t Affect Mergesort
Conference Paper
Full-text available
  • Jun 2012
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...

Citations

... 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) ...
Reference: Origami: A High-Performance Mergesort Framework