Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

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, t...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. C-36; no. 5; pp. 547 - 553
Main Authors DALLY, W. J, SEITZ, C. L
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.05.1987
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Communication networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
concurrent computation
Exact sciences and technology
graph model
interconnection networks
message passing multiprocessors
parallel processing
Software
Deadlock
Multiprocessor
Interconnection
Network
Concurrent task
Parallel processing
Algorithm
Message transmission
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1987.1676939