Carleton University
Technical Report TR-98-06
June 1998
TR-98-06: A Note on Coarse Grained Parallel Integer Sorting
A. Chan & F. Dehne
Abstract
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), O(n/p) memory per processor and O(n/p) local computation.