Deadlock-free adaptive routing in multicomputer networks usingvirtual channels
Dally, W.J.
Aoki, H.
MIT, Cambridge, MA;
This paper appears in: Parallel and Distributed Systems, IEEE Transactions on
Publication Date: Apr 1993
Volume: 4,
Issue: 4
On page(s): 466-475
ISSN: 1045-9219
References Cited: 45
CODEN: ITDSEO
INSPEC Accession Number: 4466307
Digital Object Identifier: 10.1109/71.219761
Current Version Published: 2002-08-06
Abstract
The use of adaptive routing in a multicomputer interconnection
network improves network performance by using all available paths and
provides fault tolerance by allowing messages to be routed around failed
channels and nodes. Two deadlock-free adaptive routing algorithms are
described. Both algorithms allocate virtual channels using a count of
the number of dimension reversals a packet has performed to eliminate
cycles in resource dependency graphs. The static algorithm eliminates
cycles in the network channel dependency graph. The dynamic algorithm
improves virtual channel utilization by permitting dependency cycles and
instead eliminating cycles in the packet wait-for graph. It is proved
that these algorithms are deadlock-free. Experimental measurements of
their performance are presented
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
