The data transfer path from the calculation of this algorithm is the shortest deadlock-free transfer path.
根据该算法得出的数据传输路径是无死锁的最短传输路径。
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.
在避免系统死锁的前提下，设计了基于目录的无效使能协议，并证明其保证了缓存一致性。
Disagreement does not cause deadlock because the lander are free to experiment.
分歧并不会导致僵局产生，因为联邦州(lander)可以自由实行教育试点工程。
Both partially adaptive NPN and deterministic IDO are minimal, deadlock and livelock free.
部分自适应的NPN和确定性的IDO都是无死锁，无活锁且最短的路由算法。
Based on the analysis of the deadlock condition, a deadlock free method is proposed and implemented.
通过对系统死锁条件的分析，提出并实现了一种避免死锁产生的方法。
We show that this protocol is free of deadlock and in addition a high priority transaction is not blocked by uncommitted lower priority transactions.
这个协议可以避免死锁，而且高优先级事务不会被未提交的低优先级事务阻塞。
We analyse three routing examples and describe the development of the necessary and sufficient conditions for wormhole deadlock free routing.
本文通过三个虫孔寻径无死锁的具体实例，深入阐述、分析了虫孔寻径无死锁充要条件的研究进展。
We analyse three routing examples and describe the development of the necessary and sufficient conditions for wormhole deadlock free routing.
本文通过三个虫孔寻径无死锁的具体实例，深入阐述、分析了虫孔寻径无死锁充要条件的研究进展。
应用推荐