Abstract
An algorithm for sorting on a mesh by alternately transforming the rows and columns is presented. The algorithm runs in a constant number of row- and column-transformation phases (sixteen phases), an improvement over the previous best upper bound ofO(log logm) phases,m being the number of rows in the mesh. A corresponding lower bound of five phases is also shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ajtai, M., J. Komlos, and S. Szemeredi, AnO(N logN) Sorting Network, inProceedings of the 25th ACM Symposium on Theory of Computing, 1982, pp. 1–9.
Bilardi, G., and F. P. Preparata, The VLSI Optimality of the AKS Sorting Network,Information Processing Letters 20, 2 (Feb. 1985), pp. 55–59.
Knuth, D. E.,The Art of Computer Programming, Vol. 3, Addison Wesley, Reading, MA, 1973.
Kumar, M., and D. S. Hirschberg, An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes,IEEE Transactions on Computers 32, 3 (March 1983), pp. 254–264.
Kunde, M., Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers, inProceedings of the 4th Symposium on Theoretical Aspects of Computer Science, 1987, pp. 408–419.
Lang, H. W., M. Schimmler, H. Schmeck, and H. Schroder, Systolic Sorting on a Mesh-Connected Network,IEEE Transactions on Computers 34, 7 (July 1984), pp. 652–658.
Leighton, T., Tight Bounds on the Complexity of Parallel Sorting,IEEE Transactions on Computers 34, 4 (April 1985), pp. 344–354.
Nassimi, D., and S. Sahni, Bitonic Sort on a Mesh-Connected Parallel Computer,IEEE Transactions on Computers 28, 1 (Jan. 1979), pp. 2–7.
Sado, K., and Y. Igarashi, Some Parallel Sorts on a Mesh-Connected Array and Their Time Efficiency,Journal of Parallel and Distributed Computing 3, 3 (Sept. 1986), pp. 398–410.
Scherson, I. D., S. Sen, and A. Shamir, Shear Sort: A True Two-Dimensional Sorting Technique for VLSI Networks, inProceedings of the 1986International Conference on Parallel Processing, 1986, pp. 903–908.
Schnorr, C. P., and A. Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers, inProceedings of the 18th ACM Symposium on Theory of Computing, 1986, pp. 255–261.
Thompson, C. D., and H. T. Kung, Sorting on a Mesh-Connected Parallel Computer,Communications of the Association for Computing Machinery 20, 4 (April 1977), pp. 263–271.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
This research was supported by the National Science Foundation under Grant DCR-84-51396, and by IBM Corporation under Grant D8400622.
Rights and permissions
About this article
Cite this article
Marberg, J.M., Gafni, E. Sorting in constant number of row and column phases on a mesh. Algorithmica 3, 561–572 (1988). https://doi.org/10.1007/BF01762132
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01762132