Abstract
We propose a balanced bin sort for hypercube multicomputers. This sorting algorithm has an empirically measured expected run time that is greater than that of hyperquicksort but less than that of bitonic sort. Also, its space requirements are less than that of hyperquicksort but more than that of bitonic sort. So, it is useful in situations in which there is some excess memory but not enough to run hyperquicksort.
Similar content being viewed by others
References
Chan, T., and Saad, Y. 1986. Multigrid algorithms on the hypercube multiprocessor. IEEE Transactions on Computers, C-35 (Nov).
Cole, R. 1987. Parallel merge sort. Ultracomputer Note No. 115, Computer Science Tech. Rep. No. 278, Courant Institute of Mathematical Science, New York.
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.
Lakshmivarahan, S., Dhall, S., and Miller, L. 1984. Parallel sorting algorithms. Advances in Computers, 23: 295–354.
Seidel, S.R., and George, W.L. 1987. A sorting algorithm for hypercubes with d-port communication. Tech. Rept. Dept. of Mathematical and Computer Science, Michigan Technological University.
Seidel, S.R., and Ziegler, L.R. 1987. Sorting on hypercubes. Hypercube Multiprocessors 1987, SIAM.
Wagar, B. 1987. Hyperquicksort - A fast sorting algorithm for hypercubes. Hypercube Multiprocessors 1987, SIAM.
Won, Y. 1987. Parallel solutions for design automation problems. Ph.D. dissertation, Computer Science Dept., Univ. Minnesota.
Author information
Authors and Affiliations
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
About this article
Cite this article
Won, Y., Sahni, S. A balanced bin sort for hypercube multicomputers. J Supercomput 2, 435–448 (1988). https://doi.org/10.1007/BF00156678
Issue Date:
DOI: https://doi.org/10.1007/BF00156678