Login / Signup

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

Ran Libeskind-Hadas
Published in: IEEE Trans. Computers (1998)
Keyphrases
  • lower bound
  • upper bound
  • worst case
  • objective function
  • databases
  • optimal solution
  • deadlock free