Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses
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.
KeywordsLocal Computation Queue Size Destination Address Packet Collision Local Connection
Unable to display preview. Download preview PDF.
- 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
- 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
- Lei92.F.T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, Morgan Kaufmann (1992).Google Scholar
- MS96.R. Miller and Q.F. Stout, Parallel algorithms for regular architectures: meshes and pyramids, The MIT Press (1996).Google Scholar
- MR95.R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press (1995).Google Scholar
- 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