A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
A Note on Coarse Grained Parallel Integer Sorting
[chapter]
High Performance Computing Systems and Applications
We observe that for n=p p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds (6 n p -relations and 18 p-relations), On=p memory per processor and On=p local computation. Experimental data indicates that the algorithm has very good performance in practice.
doi:10.1007/0-306-47015-2_36
fatcat:afjgtn6onrhwnnqgizznvbv7ta