Abstract
We give two, new upper bounds for oblivious permutation routing on the mesh network. One is an O(N 0.75) algorithm for the two-dimensional mesh with constant queue-size. This is the first algorithm which improves substantially the trivial O(N) bound. The other is an \( 1.16\sqrt N {\mathbf{ }} + {\mathbf{ }}o(\sqrt N {\mathbf{ }}) \) algorithm on the three-dimensional mesh with unlimited queue-size. This algorithm allows at most three bends in the path of each packet. If the number of bends is restricted to minimal, i.e., at most two, then the bound jumps to Ω(N 2/3) as was shown in ESA’97.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Bar-Noy, P. Raghavan, B. Schieber and H. Tamaki, “Fast deflection routing for packets and worms,” In Proc. ACM Symposium on Principles of Distributed Computing (1993) 75–86.
A. Borodin and J.E. Hopcroft, “Routing, merging, and sorting on parallel models of computation,” J. Computer and System Sciences 30 (1985) 130–145.
A. Borodin, P. Raghavan, B. Schieber and E. Upfal, “How much can hardware help routing?,” In Proc. ACM Symposium on Theory of Computing (1993) 573–582.
D.D. Chinn, T. Leighton and M. Tompa, “Minimal adaptive routing on the mesh with bounded queue size,” J. Parallel and Distributed Computing 34 (1996) 154–170.
K. Iwama and E. Miyano, “Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing,” In Proc. 5th European Symposium on Algorithms (1997) 284–295.
C. Kaklamanis, D. Krizanc and A. Tsantilas, “Tight bounds for oblivious routing in the hypercube,” Mathematical Systems Theory 24 (1991) 223–232.
C. Kaklamanis, D. Krizanc and S. Rao, “Simple path selection for optimal routing on processor arrays,” In Proc. 1992 ACM Symposium on Parallel Algorithms and Architectures (1992) 23–30.
D. Krizanc, “Oblivious routing with limited buffer capacity,” J. Computer and System Sciences 43 (1991) 317–327.
F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann (1992).
F.T. Leighton, F. Makedon and I. Tollis, “A 2n — 2 step algorithm for routing in an n × n array with constant queue sizes,” Algorithmica 14 (1995) 291–304.
J.F. Sibeyn, B.S. Chlebus and M. Kaufmann, “Deterministic permutation routing on meshes,” J. Algorithms 22 (1997) 111–141.
M. Tompa, Lecture notes on message routing in parallel machines, Technical Report # 94-06-05, Dept of Computer Sci. & Eng., Univ of Washington (1994).
L.G. Valiant and G.J. Brebner, “Universal schemes for parallel communication,” In Proc. ACM Symposium on Theory of Computing (1981) 263–277.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwama, K., Kambayashi, Y., Miyano, E. (1998). New Bounds for Oblivious Mesh Routing. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-68530-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64848-2
Online ISBN: 978-3-540-68530-2
eBook Packages: Springer Book Archive