Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

  • Authors:
  • W. J. Dally;C. L. Seitz

  • Affiliations:
  • Massachusettes Institute of Technology, Cambridge;California Institute of Technology, Pasadena

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

Quantified Score

Hi-index 15.15

Visualization

Abstract

A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.