In-Place Parallel Super Scalar Samplesort (IPSSSSo)

DOI10.4230/LIPIcs.ESA.2017.9zbMath1442.68043arXiv1705.02257OpenAlexW2964316344MaRDI QIDQ5111694

Michael Axtmann, Sascha Witt, Peter Sanders, Daniel Ferizovic

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1705.02257

zbMATH Keywords

parallel sortingshared memoryin-place algorithmcomparison-based sortingbranch prediction

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (2)

BlockQuicksort ⋮ In-Place Parallel Super Scalar Samplesort (IPSSSSo)

Uses Software

• MCSTL
• CMU Benchmarks
• Intel TBB
• Quicksort
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• A simple algorithm for in-place merging
• On a Model of Virtual Address Translation
• Parallel String Sample Sort
• Multiway In-Place Merging
• Engineering a cache-oblivious sorting algorithm
• An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
• BlockQuicksort: Avoiding Branch Mispredictions in Quicksort
• In-Place Parallel Super Scalar Samplesort (IPSSSSo)
• Multi-Pivot Quicksort: Theory and Experiments
• How Branch Mispredictions Affect Quicksort
• Algorithms – ESA 2004
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

This page was built for publication: In-Place Parallel Super Scalar Samplesort (IPSSSSo)