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

We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. 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. Key words: Parallel algorithms, Interconnection networks, Mesh, Packet routing

• Type: Conference
• Year: 2001
• Where: EUROPAR
• Authors: Andrea Pietracaprina, Geppino Pucci
• Keywords: Algorithms, EUROPAR 2001, Many-to-one Routing, N-node Two-dimensional Mesh