A guided tour of Chernoff bounds
Information Processing Letters
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
Deterministic 1-k Routing on Meshes
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Hi-index | 0.89 |
We present randomized and deterministic algorithms for many-to-one packet routing on an n-node two-dimensional mesh under the store-and-forward model. We consider the general instance of many-to-one routing where each node is the source (resp., destination) of @? (resp., k) packets, for arbitrary values of @? and k. All our algorithms run in optimal O(@?kn) time and use queues of only constant size at each node to store packets in transit. The randomized algorithms, however, are simpler to implement. Our result closes a gap in the literature, where time-optimal algorithms using constant-size queues were known only for the special cases @?=1 and @?=k.