论文信息 - Load balanced sort on hypercube multiprocessors

Load balanced sort on hypercube multiprocessors

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.

Abdulla Bataineh | Fusun Ozguner | Bulent Abali

[1] Lennart Johnsson,et al. Combining Parallel and Sequential Sorting on a Boolean n–cube , 1984 .

[2] .. G. Plaxton. Load Balancing , Selection and Sorting on the HypercubeC , 1989 .

[3] C. Greg Plaxton. Load balancing, selection sorting on the hypercube , 1989, SPAA '89.

[4] S. R. Seidel,et al. Binsorting on hypercubes with d-port communication , 1989, C3P.

[5] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.

[6] S. F. Nugent,et al. The iPSC/2 direct-connect communications technology , 1988, C3P.