The data transfer path from the calculation of this algorithm is the shortest deadlock-free transfer path.
根据该算法得出的数据传输路径是无死锁的最短传输路径。
2
After a sufficient condition of the deadlock-free design has been given, the directory-based invalidate cache coherence protocol is introduced and its cache coherence is verified using belief.
在避免系统死锁的前提下，设计了基于目录的无效使能协议，并证明其保证了缓存一致性。
3
Disagreement does not cause deadlock because the lander are free to experiment.