This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'
September 2000 (vol. 49 no. 9)
pp. 1005

Abstract—In [1], 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.

[1] R. Libeskind-Hadas, “A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing,” IEEE Trans. Computers, vol. 47, no. 10, pp. 1,158-1,160, Oct. 1998.

Index Terms:
Deadlock-free routing, interconnection networks, strongly connected digraphs.
Citation:
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. 9, pp. 1005, Sept. 2000, doi:10.1109/12.869335
Usage of this product signifies your acceptance of the Terms of Use.