A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing

Ran Libeskind-Hadas. A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. IEEE Transactions on Computers, 47(10):1158-1160, 1998.

Abstract

Abstract is missing.