Oblivious routing with limited buffer capacity
Journal of Computer and System Sciences
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A lower bound for permutation routing on two-dimensional bused meshes
Information Processing Letters
On multidimensional packet routing for meshes with buses
Journal of Parallel and Distributed Computing
Randomized algorithms
Routing problems on the mesh of buses
Journal of Algorithms
Minimal adaptive routing on the mesh with bounded queue size
Journal of Parallel and Distributed Computing
Parallel algorithms for regular architectures: meshes and pyramids
Parallel algorithms for regular architectures: meshes and pyramids
Oblivious Routing Algorithms on the Mesh of Buses
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
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 withh ighp robability but needs more local computation.