Practical Massively Parallel Sorting

Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz
2015 Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '15  
To obtain sorting algorithms that scale to the largest available machines, conventional parallel sorting algorithms cannot be used since they either have prohibitive communication volume or prohibitive critical path length for computation. We outline ideas how to combine a number of basic algorithmic techniques which overcome these bottlenecks.
doi:10.1145/2755573.2755595 dblp:conf/spaa/AxtmannBS015 fatcat:t77prsg4g5awhpmguubfo2yyye