Deadlock-free message routing in multiprocessor interconnection networks
Journal Article
·
· IEEE Trans. Comput.; (United States)
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), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-36:5; ISSN ITCOB
- Country of Publication:
- United States
- Language:
- English
Similar Records
A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks
Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks
Fault-tolerant multiprocessors with redundant-path interconnection networks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:98895
Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87670
Fault-tolerant multiprocessors with redundant-path interconnection networks
Journal Article
·
Mon Mar 31 23:00:00 EST 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5704786