Abstract
The problem of packet routing on n 1 × ... × n r mesh-connected arrays or grids of processors is studied. For two-dimensional grids a 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 grids without wrap-arounds. Hence it is asymptotically optimal and as good as randomized algorithms routing data only with high probability. Furthermore it is demonstrated that on r-dimensional cubes of processors packet routing can be performed by asymptotically (2r − 2)n steps which is faster than the running times of so far known randomized algorithms and of deterministic algorithms.
This work was supported by the Siemens AG, München
Preview
Unable to display preview. Download preview PDF.
References
Krizanc, D.,Rajasekaran, S., Tsantilas, Th.: Optimal routing algorithms for mesh-connected processor arrays. Proceedings AWOC'88.In: Reif, J.H. (ed.),Lect. Notes Comp. Sci.,vol 319,pp. 411–422,Berlin:Springer 1988
Kunde, M., Tensi, T.: Multi-packet-routing on mesh connected arrays. To appear in: Proceedings of ACM Symposium on Parallel Algorithms and Architectures SPAA89, June 1989.
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., et al. (eds.), Lect. Notes Comp. Sci., vol. 247, pp. 408–419, Berlin: Springer 1987
Kunde, M.: Bounds for l-section and related problems on grids of processors. Proceedings of PARCELLA 88. In: Wolf, G., Legendi, T., Schendel, U. (eds.), Mathematical Research, vol. 48, pp. 298–307, Akademie Verlag, Berlin, 1988
Kunde, M.: Routing and Sorting on Mesh-Connected Arrays. Proceedings AWOC'88. In: Reif, J.H. (ed.),Lect. Notes Comp. Sci.,vol 319,pp. 423–433,Berlin:Springer 1988
Leighton, T., Makedon, F., Tollis, I.G.: A 2n − 2 algorithm for routing in an n × n array with constant size queues. To appear in: Proceedings of ACM Symposium on Parallel Algorithms and Architectures SPAA89, June 1989.
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
Rajasekaran, S., Tsantilas, Th.: An optimal randomized routing algorithm for the mesh and a class of efficient mesh-like routing networks. 7th Conf. on Found. of Software Technology and Theoret. Comp. Science, Pune, 1987, pp. 226–241
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
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kunde, M. (1989). Packet routing on grids of processors. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-51859-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51859-4
Online ISBN: 978-3-540-46831-8
eBook Packages: Springer Book Archive