## A parallel sort-balance mutual range-join algorithm on hypercube computers

- Richard Wong, Rodney W. Topor, Hong Shen
- Microprocessors and Microsystems - Embedded…
- 1998

Highly Influenced

@article{Abali1993BalancedPS, title={Balanced Parallel Sort on Hypercube Multiprocessors}, author={B{\"u}lent Abali and F{\"u}sun {\"O}zg{\"u}ner and Abdulla Bataineh}, journal={IEEE Trans. Parallel Distrib. Syst.}, year={1993}, volume={4}, pages={572-581} }

- Published in IEEE Trans. Parallel Distrib. Syst. 1993
DOI:10.1109/71.224220

A parallel sorting algorithm for sorting n elements evenly distributed over Z d = p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O( ( n log n)/p + p log2 n). The algorithm maintains a perfect load balance in the nodes by determining the (kn/p)th elements (k = 1,. . . , ( p 1)) of the final sorted list in advance. These p 1 keys are used to partition the sorted sublists in each node to redistribute data to the nodes to be merged in parallel. The… CONTINUE READING