U. Miekkala, O. Nevanlinna, et al.
DMCC 1990
A parallel algorithm for sorting n elements evenly distributed over 2d = p nodes of a d dimensional hypercube is given. The algorithm ensures that the nodes always receive equal number of elements (n/p) at the end, regardless of the skew in data distribution.
U. Miekkala, O. Nevanlinna, et al.
DMCC 1990
Leendert M. Huisman, Raja Daoud, et al.
DMCC 1990
Anthony J.G. Hey
DMCC 1990
Kwei-Jay Lin, Jen-Yao Chung, et al.
DMCC 1990