The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In [<ref type="bib" rid="bibT10051">1</ref>], Libeskind-Hadas provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. In this short note, we show a simpler proof of the tight lower bound.</p>
Deadlock-free routing, interconnection networks, strongly connected digraphs.
Li Sheng, Jie Wu, "A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'", IEEE Transactions on Computers, vol. 49, no. , pp. 1005, September 2000, doi:10.1109/12.869335
79 ms
(Ver 3.3 (11022016))