Balanced Parallel Sort on Hypercube Multiprocessors

@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}
}
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
Highly Cited
This paper has 42 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 17 citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Currently, he is with Cray Research Inc., Eagan, MN. His research interests are in the area of parallel algorithms and architectures, logic simulation, and high-speed digital

  • Inc, Eagan, MN
  • He spent the summers of ,
  • 1990

Spanning graphs for optimum broadcasting and personalized communication in hypercubes

  • M. H. Schultz
  • IEEE Trans . Comput .
  • 1989

S’90-M’92) received the B.S. degree in electrical engineering from Yarmouk University, Irbid, Jordan, in 1987, and the M.S. and Ph.D. degrees in electrical engineering from the Ohio

  • Abdulla Bataineh
  • 1988

Implementing quicksort programs Optimal communication algorithms on hypercube

  • C.-T. Ho
  • Proc . AFIPS SrCC
  • 1986

S

  • CA, July
  • L. Johnsson and C.-T. Ho, “Spanning graphs for…
  • 1986

Q

  • CT Haven, Oct.
  • F. Stout and B. Wagar, “Passing messages in link…
  • 1985