Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
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
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Minimal adaptive routing on the mesh with bounded queue size
Journal of Parallel and Distributed Computing
Deterministic permutation routing on meshes
Journal of Algorithms
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
We give two, new upper bounds for oblivious permutation routing on the mesh network. One is an O(N0:75) algorithm for the twodimensional mesh with constant queue-size. This is the first algorithm which improves substantially the trivial O(N) bound. The other is an 1:16√N + o(√N) 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 Ω(N2=3) as was shown in ESA'97.