通过对系统死锁条件的分析，提出并实现了一种避免死锁产生的方法。
Based on the analysis of the deadlock condition, a deadlock free method is proposed and implemented.
在分布式系统研究领域中，死锁条件通常是根据资源请求方式来确定的。
In the research area of distributed systems, deadlock conditions are commonly determined by resource request mode.
本文将详细介绍分布式事务、并发控制和资源请求模型，总结出分布式数据库系统的通用死锁条件。
In this paper, distirbuted transaction, concurrency control and resource request model are introduced in detail. The universal deadlock condition in distirbuted database system is summarized.
分布式数据库不同于一般分布式系统，其死锁条件不仅与资源请求方式相关，而且与资源授予方式相关。
Distributed database is different from general distributed system, it's deadlock condition is not only related with resource request mode, but also related with resource grant mode.
一方面，线程是轻量级的，并且相互之间易于通信，但另一方面，它们也带来了包括死锁、争用条件和高复杂性在内的各种问题。
On one hand, threads are lightweight and easy to communicate with, but on the other hand, they bring up a whole host of problems including deadlocks, race conditions, and sheer complexity.
尤其是潜在的竞态条件和死锁会突然间成为最令人头疼的问题。
Specifically, problems such as race conditions and deadlocks that lie dormant could suddenly become major problems.
由于在基本编辑模式下无法定义所需的可选输入条件，因此在该模式中绘制的大多数逆向连接都会导致模型死锁。
The required alternative input criteria cannot be defined in the basic editing mode, so most backward connections drawn in basic editing mode add a deadlock to the model.
甚至在确定了会产生问题的几行关键代码后，依旧难以解耦那些会导致竞态条件或者死锁的交叉存取事件。
Even after isolating a problem down to a few crucial lines of code, it can be difficult to untangle the interleaved events required to make a race condition or deadlock occur.
这个中间件通过给我们的请求加一个互斥来保护我们避免竟太条件和死锁。
This middleware is supposed to protect us from nasty race conditions and deadlocks by wrapping our requests with a mutex.
四个条件存在时死锁一定是正确的吗？
Is deadlock necessarily true when the four conditions exist?
本文通过三个虫孔寻径无死锁的具体实例，深入阐述、分析了虫孔寻径无死锁充要条件的研究进展。
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.
应用推荐