A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks Deadlocks occur in interconnection networks as messages compete for free channels or empty buffers. Deadlocks are often associated with a circular wait between processes and resources. In the context of networks...
One effective method is to partition the physical network into several virtual networks such that ther... Z Liu,J Duato,LE Thorelli - Springer-Verlag 被引量: 48发表: 1993年 A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks Deadlocks occur in ...