This Article 
 Bibliographic References 
 Add to: 
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
May 1987 (vol. 36 no. 5)
pp. 547-553
W.J. Dally, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
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.
Index Terms:
parallel processing, Communication networks, concurrent computation, graph model, interconnection networks, message passing multiprocessors
W.J. Dally, C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks," IEEE Transactions on Computers, vol. 36, no. 5, pp. 547-553, May 1987, doi:10.1109/TC.1987.1676939
Usage of this product signifies your acceptance of the Terms of Use.