Issue No. 05 - May (1987 vol. 36)
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.
parallel processing, Communication networks, concurrent computation, graph model, interconnection networks, message passing multiprocessors
C. Seitz and W. Dally, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks," in IEEE Transactions on Computers, vol. 36, no. , pp. 547-553, 1987.