3 citations · 6 across the 6 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014
Practical Massively Parallel Sorting
Michael Axtmann, Timo Bingmann, Peter Sanders +1
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We…
cs.DS2014★ 3 cited
Engineering Parallel String Sorting
Timo Bingmann, Andreas Eberle, Peter Sanders
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and succes…