Optimal Many-to-One Routing on the Mesh with Constant Queues

Authors:
Andrea Pietracaprina;Geppino Pucci
Affiliations:
-;-
Venue:
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Year:
2001

Citing 7
Cited 0

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
Hot potato worm routing via store-and-forward packet routing

Journal of Parallel and Distributed Computing
A Theory of Wormhole Routing in Parallel Computers

IEEE Transactions on Computers
Packet routing in fixed-connection networks: a survey

Journal of Parallel and Distributed Computing
One-to-Many routing on the mesh

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Deterministic 1-k Routing on Meshes

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model.We consider a general instance of the problem, where each node is source (resp., destination) of l (resp., k) packets, for arbitrary values of l and k. All our algorithms run in optimal O (√lkn) 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 l = 1 and l = k.