Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10334297 | Theoretical Computer Science | 2005 | 16 Pages |
Abstract
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). We present an asymptotically optimal O(knd) 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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andre Osterloh,