Summary
Lower bounds for sorting on mesh-connected arrays of processors are presented. For sorting N=n1 n 2...n r elements on an n 1×n2×... ×n r array 2(n 1+...+n r−1)+n r data interchange steps are needed asymptotically. For two dimensions these bounds are asymptotically best possible provided that n 1 and n 2 are powers of 2. In this case the generalized s 2-way merge sort of Thompson and Kung turns out to be asymptotically optimal. The minimal asymptotic bound of 2 √2N interchange steps can be obtained only by sorting algorithms suitable for √N/2×√2N meshes. For r≧3 dimensions an analysis of aspect-ratios also demonstrates that there exist mesh-connected architectures which are better suited for sorting than simple r-dimensional cubes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Foster, M.J., Kung, H.T.: The design of special-purpose VLSI-chips. IEEE Trans. Comput. 13, 26–40 (1980)
Kumar, M., Hirschberg, D.S.: An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes. IEEE Trans. Comput. C-32, 254–264 (1983)
Kunde, M.: A general approach to sorting on 3-dimensionally mesh-connected arrays. In: Händler, W. (eds.) Lect. Notes Comput. Sci., vol. 237, pp. 84–95. Berlin-Heidelberg-New York-Tokyo: Springer 1986
Kunde, M.: Optimal sorting on multi-dimensionally mesh-connected computers. Proceedings of STACS 87. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) Lect. Notes Comput. Sci., vol. 247, pp. 408–419. Berlin-Heidelberg-New York-Tokyo: Springer 1987
Kung, H.T., Leiserson, C.E.: Systolic arrays for VLSI. Symposium on Sparse Matrix Computation 1978, Proceeding, Duff, I.S., Stewart, C.G. (eds.) 1978
Lang, H.-W., Schimmler, M., Schmeck, H., Schréder, H.: Systolic sorting on a mesh-connected network. IEEE Trans. Comput. C-34, 652–658 (1985)
Nassimi, D., Sahni, S.: Bitonic sort on a mesh-connected parallel computer. IEEE Trans. Comput. C-28, 2–7 (1979)
Sado, K., Igarashi, Z.: A fast parallel pseudeo-merge sort algorithm. Gunma University, Technical Report, Japan, 1985
Schimmler, M.: Fast sorting on a three dimensional cube grid. Technical Report 8604, University of Kiel, Germany, 1986
Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh-connected computers, pp. 255–263. Proceedings STOC 1986. Berkeley 1986
Schmeck, H., Schréder, H., Starke, C.: Systolic s 2-way merge sort is optimal. Technical Report 8606, University of Kiel, Germany, 1986
Thompson, C.D., Kung, H.T.: Sorting on a mesh-connected parallel computer. CACM 20, 263–271 (1977)
Author information
Authors and Affiliations
Additional information
This work was done at the Institut für Informatik und Praktische Mathematik, University of Kiel, Federal Republic of Germany
Rights and permissions
About this article
Cite this article
Kunde, M. Lower bounds for sorting on mesh-connected architectures. Acta Informatica 24, 121–130 (1987). https://doi.org/10.1007/BF00264359
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264359