Deadlock-free message routing in multiprocessor interconnection networks

Journal Article · Fri May 01 00:00:00 EDT 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.1676939· OSTI ID:6778475

Dally, W J; Seitz, C L

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.

• Research Organization: Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139
• OSTI ID: 6778475
• Journal Information: IEEE Trans. Comput.; (United States), Vol. C-36:5
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ARRAY PROCESSORS
ALGORITHMS
DATA TRANSMISSION
ROUTING
COMPUTER GRAPHICS
COMPUTER NETWORKS
EQUIPMENT INTERFACES
GRAPHS
COMMUNICATIONS
MATHEMATICAL LOGIC
990210* - Supercomputers- (1987-1989)