A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A universal proof technique for deadlock-free routing in interconnection networks
1995
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95
An important open problem in interconnection network routing has been to characterize the conditions under which routing algorithms are deadlock-free. Although this problem has been resolved for restricted classes of routing algorithms, no general solution has been found. In this paper, we solve this problem by proving a necessary and sufficient condition that can be used for any interconnection network routing algorithm, as long as only local information is required for routing. Our proof
doi:10.1145/215399.215440
dblp:conf/spaa/SchwiebertJ95
fatcat:jtrtfcjwtndujpdxercjt3uag4