Optimal fully adaptive wormhole routing for meshes
Conference
·
OSTI ID:46272
- Ohio State Univ., Columbus, OH (United States). Dept. of Computer and Information Science
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. The routing algorithm imposes less than half as many routing restrictions as any previous fully adaptive routing algorithm. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm that achieves both of these goals. The implementation of the routing algorithm requires relatively simple router control logic. The new algorithm is extended, in a straightforward manner to arbitrary dimension meshes. It needs only 4n-2 virtual channels, the minimum number for an n-dimensional mesh. All previous algorithms require an exponential number of virtual channels in the dimension of the mesh.
- OSTI ID:
- 46272
- Report Number(s):
- CONF-931115--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks
A survey of routing techniques in store-and-forward and wormhole interconnects.
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:98895
Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87670
A survey of routing techniques in store-and-forward and wormhole interconnects.
Technical Report
·
Mon Dec 31 23:00:00 EST 2007
·
OSTI ID:946588