Abstract
The mesh of buses (MBUS) is a parallel computation model which consists of n × n processors, n row buses and n column buses but no local connections between two neighboring processors. As for deterministic (permutation) routing on MBUSs, the known 1.5n upper bound appears to be hard to improve. Also, the information theoretic lower bound for any type of MBUS routing is 1.0n. In this paper, we present two randomized algorithms for MBUS routing. One of them runs in 1.4375n+o(n) steps with high probability. The other runs 1.25n+o(n) steps also with high probability but needs more local computation.
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
H. Chernoff, “A Measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,” Annals of Mathematical Statistics, 23 (1952) 493–507.
S. Cheung and F.C.M. Lau, “A lower bound for permutation routing on two-dimensional bused meshes,” Information Processing Letters, 45 (1993) 225–228.
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, E. Miyano, and Y. Kambayashi, “Routing problems on the mesh of buses,” J. Algorithms, 20 (1996) 613–631.
K. Iwama and E. Miyano, “Oblivious routing algorithms on the mesh of buses,” In Proc. International Parallel Processing Symposium (1997) 721–727.
K. Iwama and E. Miyano, “Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing,” In Proc. European Symposium on Algorithms (1997) 154–170.
A. Joffe, “On a set of almost deterministic k-independent random variables,” The Annals of Probability, Vol.2 (1974) 161–162.
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).
L.Y.T. Leung and S.M. Shende, “On multidimensional packet routing for meshes with buses,” J. Parallel and Distributed Computing, 20 (1994) 187–197.
R. Miller and Q.F. Stout, Parallel algorithms for regular architectures: meshes and pyramids, The MIT Press (1996).
R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press (1995).
M. Tompa, Lecture notes on message routing in parallel machines, Technical Report # 94-06-05, Department of Computer Science & Engineering, University of Washington (1994).
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., Miyano, E., Tajima, S., Tamaki, H. (1998). Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-68535-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64824-6
Online ISBN: 978-3-540-68535-7
eBook Packages: Springer Book Archive