Abstract
The problems of sorting and routing on n 1×... × n r mesh-connected arrays of processors are studied. A new sorting algorithm for r-dimensional meshes, r≥3, is presented. On meshes without wrap-around-connections it only needs 2(n 1+...+n r−1)+n r steps which is asymptotically optimal. For meshes with wrap-arounds the number of steps is asymptotically n 1+n 2+...+n r which is very close to the lower bound of (n 1+...+n r−1)+n r /2. Furthermore, for two-dimensional meshes a new deterministic routing algorithm is given for n×n meshes where each processor has a buffer of size f(n)<n. It needs 2n+O(n/f(n)) steps on meshes without wrap-arounds. Hence it is asymptotically optimal and as good as randomized algorithms routing data only with high probability.
This work was supported by the Siemens AG, München
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Foster, M.J., Kung, H.T.: The design of special-purpose VLSI-chips. IEEE 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ändlers, W. (eds.) Lect. Notes Comput. Sci., vol. 237, pp. 84–95. Berlin-Heidelberg-New York-Tokyo: Springer 1986
Kunde, M.: Lower bounds for sorting on mesh-connected architectures. Acta Informatica 24, 121–130 (1987).
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 Comp. Sci., vol. 247, pp. 408–419. Berlin-Heidelberg-New York-Tokyo: Springer 1987
Kunde, M.: Bounds for l-section and related problems on grids of processors; submitted
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
Knuth, D.E.: The art of computer programming, vol. 3: Sorting and Searching, Addison Wesley, Reading, 1973, pp. 224–225.
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)
Ma, Y., Sen, S., Scherson, I.D.: The distance bound for sorting on mesh-connected processor arrays is tight. Proceedings FOCS 86, pp. 255–263
Nassimi, D., Sahni, S.: Bitonic sort on a mesh-connected parallel computer. IEEE Trans. Comput. C-28, 2–7 (1979)
Rajasekaran, S., Tsantilas, Th.: An optimal randomized routing algorithm for the mesh and a class of efficient mesh-like routing networks. 7th Conference on Foundations of Software Technology and Theoretical Science, Pune, India
Sado, K., Igarashi, Z.: A fast parallel pseudo-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. Berkley 1986
Thompson, C.D., Kung, H.T.: Sorting on a mesh-connected parallel computer. CACM 20, 263–271 (1977)
Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication. Proceedings STOC 81, pp. 263–277.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kunde, M. (1988). Routing and sorting on mesh-connected arrays. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040409
Download citation
DOI: https://doi.org/10.1007/BFb0040409
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96818-6
Online ISBN: 978-0-387-34770-7
eBook Packages: Springer Book Archive