Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomized algorithms
k-k routing, k-k sorting, and cut-through routing on the mesh
Journal of Algorithms
Deterministic permutation routing on meshes
Journal of Algorithms
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
An O( N ) oblivious routing algorithm for 2-D meshes of constant queue-size
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
New Bounds for Oblivious Mesh Routing
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A (2.954 + ε)n oblivious routing algorithm on 2D meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
Our model in this paper is the standard, two-dimensional n脳n mesh. The first result is a randomized algorithm for h-h routing which runs in O(hn) steps with high probability using queues of constant size. The previous bound is 0:5hn + o(hn) but needs the queue-size of 驴(h). An important merit of this algorithm is to give us improved bounds by applying several schemes of faultymesh routing. For example, the scheme by [Rag95], originally O(n log n) time and O(log2 n) queue-size, gives us an improved routing algorithm on p-faulty meshes (p ≤ 0:4) which runs in O(nlog2 n/k) time using O(k) queue-size for any k 驴 log n. Thus, when k = log n it improves the queue-size by the factor of log n without changing the time bound and when k is constant, it needs only constant queue-size although the running time slows down by the factor of log n.