Balanced parallel sort on hypercube multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/26046
A parallel sorting algorithm for sorting n elements evenly distributed over 2d =p nodes of a d-dimensional hypercube is presented. The speed of the sorting algorithm is further enhanced by the distance-d communication capability of the iPSC/2 hypercube computer and novel conflict-free routing algorithm. Experimental results on a 16-node hypercube computer show that the new sorting algorithm is competitive with the previous algorithms, and faster for skewed data distributions.
- Research Paper