Subscribe
Issue No.09 - September (1999 vol.10)
pp: 904-921
ABSTRACT
<p><b>Abstract</b>—A spate of deadlock avoidance-based and deadlock recovery-based routing algorithms have been proposed in recent years without full understanding of the likelihood and characteristics of actual deadlocks in interconnection networks. This work models the interrelationships between routing freedom, message blocking, correlated resource dependencies, and deadlock formation. It is empirically shown that increasing routing freedom, as achieved by allowing unrestricted routing over multiple physical and virtual channels, reduces the probability of deadlocks and the likelihood of other types of correlated message blocking that can degrade performance. Moreover, when <it>true</it> fully adaptive routing is used in <tmath>$k$</tmath>-ary <tmath>$n$</tmath>-cube networks with two or more virtual channels (wormhole or virtual cut-through switched), it is empirically shown that deadlocks are virtually eliminated in networks with <tmath>$n \geq 2$</tmath>. These results indicate that deadlocks are very infrequent when the network and routing algorithm inherently provide sufficient routing freedom, thus increasing the viability of deadlock recovery routing strategies.</p>
INDEX TERMS
Deadlock characterization, deadlock detection, deadlock recovery, true fully adaptive routing, $k$-ary $n$-cube interconnection networks.
CITATION
Timothy Mark Pinkston, Sugath Warnakulasuriya, "Characterization of Deadlocks in k-ary n-Cube Networks", IEEE Transactions on Parallel & Distributed Systems, vol.10, no. 9, pp. 904-921, September 1999, doi:10.1109/71.798315