A time-randomness tradeoff for oblivious routing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
A (2.954 + ε)n oblivious routing algorithm on 2D meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
An O( N) oblivious routing algorithm for two-dimensional meshes of constant queue-size
Journal of Algorithms
Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks
Communication in Parallel Systems
SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
| Hi-index | 0.00 |
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). We present an asymptotically optimal O(k√nd) step oblivious k-k routing algorithm for d-dimensional n × .... × n meshes of nd processors for all k ≥ 1 and d 1. We further show how the algorithm can be used to achieve asymptotically optimal oblivious k-k routing algorithms on other networks.