A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'
Issue No. 09 - September (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.869335
<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.
L. Sheng and J. Wu, "A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'," in IEEE Transactions on Computers, vol. 49, no. , pp. 1005, 2000.