The Community for Technology Leaders
Green Image
<p>We present two new packet routing algorithms for parallel computers with torus interconnection networks of arbitrary size and dimension. Both algorithms use only minimal length paths, are fully adaptive in the sense that all minimal length paths may be used to avoid congestion, and are free of deadlock, livelock and starvation. Algorithm 1 requires only three central queues per routing node. It is the first known minimal length packet routing algorithm for torus networks which requires a constant number of queues per node, regardless of the size and dimension of the torus. In fact, the requirement of three queues per node is optimal, as no such algorithm is possible when all nodes have two or fewer queues. Algorithm 2 requires only that each node have two input buffers per edge. It is the first known minimal-fully-adaptive packet routing algorithm for torus networks which does not require central queues and which does not require any node to have more than two input or two output buffers per edge. Both algorithms are simple and appear to be well-suited to VLSI implementation. They can be used with either store-and-forward or virtual cut-through routing.</p>
multiprocessor interconnection networks; VLSI; packet switching; deadlock-free packet routing algorithms; torus networks; torus interconnection networks; minimal length packet routing; VLSI implementation.
L. Gravano, R. Cypher, "Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks", IEEE Transactions on Computers, vol. 43, no. , pp. 1376-1385, December 1994, doi:10.1109/12.338097
92 ms
(Ver 3.3 (11022016))