Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses

  • Kazuo Iwama
  • Eiji Miyano
  • Satoshi Tajima
  • Hisao Tamaki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1449)


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.


Local Computation Queue Size Destination Address Packet Collision Local Connection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Che52.
    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.MathSciNetzbMATHCrossRefGoogle Scholar
  2. CL93.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  3. CLT96.
    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.CrossRefGoogle Scholar
  4. IMK96.
    K. Iwama, E. Miyano, and Y. Kambayashi, “Routing problems on the mesh of buses,” J. Algorithms, 20 (1996) 613–631.zbMATHCrossRefMathSciNetGoogle Scholar
  5. IM97a.
    K. Iwama and E. Miyano, “Oblivious routing algorithms on the mesh of buses,” In Proc. International Parallel Processing Symposium (1997) 721–727.Google Scholar
  6. IM97b.
    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.Google Scholar
  7. Jof74.
    A. Joffe, “On a set of almost deterministic k-independent random variables,” The Annals of Probability, Vol.2 (1974) 161–162.zbMATHMathSciNetCrossRefGoogle Scholar
  8. Kri91.
    D. Krizanc, “Oblivious routing with limited buffer capacity,” J. Computer and System Sciences, 43 (1991) 317–327.zbMATHCrossRefMathSciNetGoogle Scholar
  9. Lei92.
    F.T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, Morgan Kaufmann (1992).Google Scholar
  10. LS94.
    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.zbMATHCrossRefGoogle Scholar
  11. MS96.
    R. Miller and Q.F. Stout, Parallel algorithms for regular architectures: meshes and pyramids, The MIT Press (1996).Google Scholar
  12. MR95.
    R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press (1995).Google Scholar
  13. Tom94.
    M. Tompa, Lecture notes on message routing in parallel machines, Technical Report # 94-06-05, Department of Computer Science & Engineering, University of Washington (1994).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Kazuo Iwama
    • 1
  • Eiji Miyano
    • 2
  • Satoshi Tajima
    • 3
  • Hisao Tamaki
    • 4
  1. 1.Department of Information ScienceKyoto UniversityKyotoJapan
  2. 2.Kyushu Institute of DesignFukuokaJapan
  3. 3.Systems and Software Research Laboratories, Research and Development CenterToshiba CorporationKawasakiJapan
  4. 4.Department of Computer ScienceMeiji UniversityKawasakiJapan

Personalised recommendations