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

  • Authors:

  • Li Sheng;Jie Wu

  • Affiliations:

  • -;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 2000

Quantified Score

Hi-index 14.98

Visualization

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.