摘要
为了有效地解决分布式环境下的死锁探测与解除问题,本文提出了一种基于请求路径双向探测的方法,此方法较以前各类方法具有更好的分布性、可靠性和更短的死锁探测时间。
In order to effectively solve the deadlock detecting and releasing problems in a distributed system, a new method based on bidirectional probing is developed. By using this method, two detecting signals, probB and probF, will be produced whenever a transaction with a higher priority requests a resource held by a transaction with a lower priority. probF will be sent forward and probB backward along the request path. Whenever two signals probB and probF meet somewhere on the path, deadlock will be reported in the system and an algorithm will come to release it. The method proposed is of higher reliability, higher parallelism and with shorter deadlock detecting delay than all currently used methods.
出处
《华中理工大学学报》
CSCD
北大核心
1990年第1期93-98,共6页
Journal of Huazhong University of Science and Technology
关键词
通信
分布式
死锁
探测
解除
Priority
Logic clock
Deadlock detection
Deadlock release
Transaction