Skip to main content
SpringerLink
Log in

Hypercube-to-host sorting

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

This paper discusses sorting on a hypercube multicomputer, with the assumption that the data to be sorted is initially in the hypercube memory and the sorted data is to reside in the host memory. Three algorithms-heap-and-merge, cyclic merge, and embedded binary tree-are proposed. These are evaluated experimentally on an NCUBE/7 hypercube multicomputer. The cyclic merge algorithm is found to have the best performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Deshpande, S.R., and Jenevein, R.M. 1986. Scalability of a binary tree on a hypercube. In Proceedings of the 1986 IEEE Intl. Conf. on Parallel Processing, pp. 661–668.

  • Felten, E., Karlin, S., and Otto, S. 1986. Sorting on a hypercube. Caltech/JPL, Hm 244.

  • Horowitz, E., and Sahni, S. 1986. Fundamentals of Data Structures in Pascal. Computer Science Press.

  • Seidel, S.R., and Ziegler, L.R. 1987. Sorting on hypercubes. In Proc. of the 2nd Conf. on Hypercube Multiprocessors (Knoxville, Ken., Sept. 1986), SIAM.

    Google Scholar 

  • Seidel, S.R., and George, W.L. 1987. A sorting algorithm for hypercubes with d-port communication. Tech. Report, Dept. of Mathematical and Computer Science, Michigan Technological University.

  • Siegel, J.S., Siegel, H.J., Kemmerer, F.C., Mueller, P.T., Smalley, H.E., and Smith, S.D. 1981. PASM: A partitionable SIMD/MIMD system for image processing and pattern recognition. IEEE Transactions on Computers, C-30, 12, (Dec.), pp. 934–947.

    Google Scholar 

  • Wagar, B. 1987. Hyperquicksort-A fast sorting algorithm for hypercubes. In Proc. of the 2nd Conf. on Hypercube Multiprocessors (Knoxville, Ken., Sept. 1986), SIAM.

    Google Scholar 

  • Won, Y., and Sahni, S. 1988. Balanced bin sort on hypercube multicomputers. Tech. Report, Department of Computer Science, University of Minnesota. (Dec.).

Download references

Author information

Author notes

  1. Youngju Won

    Present address: , Gongneung-Dong Nowo-Gu, P.O. Box 77, 139-799, Seoul, Korea

Authors and Affiliations

  1. Computer Science Department, University of Minnesota, 55455, Minneapolis, MN, USA

    Youngju Won & Sartaj Sahni

Authors
  1. Youngju Won
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sartaj Sahni
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported, in part, by the National Science Foundation under grants DCR 84-20935 and MIP 86-17374.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Won, Y., Sahni, S. Hypercube-to-host sorting. J Supercomput 3, 41–61 (1989). https://doi.org/10.1007/BF00129647

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00129647

Key words and phrases

Search

Navigation