The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Wormhole routing is widely employed in current generation multicomputers and the design of deadlock-free wormhole routing algorithms is an important problem. In this note, we prove a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. This result has applications in proving that certain topologies do not admit deadlock-free wormhole routing algorithms, as well as applications in the design and analysis of fault-tolerant wormhole routing algorithms.</p>
Wormhole routing, deadlock-free routing algorithms, fault tolerance.
Ran Libeskind-Hadas, "A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing", IEEE Transactions on Computers, vol. 47, no. , pp. 1158-1160, October 1998, doi:10.1109/12.729799
78 ms
(Ver 3.3 (11022016))