当前位置: X-MOL 学术Computing › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An incremental approach for detecting distributed deadlocks in the generalized model
Computing ( IF 3.7 ) Pub Date : 2021-02-04 , DOI: 10.1007/s00607-021-00904-2
Srinivasan Selvaraj

A new algorithm has been presented to detect and resolve generalized deadlock in distributed systems. In this algorithm, the initiator incrementally constructs the Local Wait-For Graph (LWFG) by propagating the probes along the edges of the Wait-For Graph and collects the replies that carry the wait-for relation between the processes directly. It updates the LWFG based on the information possessed to determine a deadlock. Proofs have been presented to authenticate its correctness. The proposed algorithm has the worst case time complexity of d + 2 time units and the message complexity of less than 2e messages, where d is the diameter and e is number of edges in the WFG. This centralized algorithm uses messages of fixed size as compared to the existing centralized algorithms. Simulation results reveal that the performance of the proposed algorithm is better or equal to the earlier generalized deadlock detection algorithms in terms of deadlock duration, message traffic and message length. Furthermore, it resolves deadlock without using additional round of messages and handles simultaneous execution of the algorithm effectively.



中文翻译:

在广义模型中检测分布式死锁的增量方法

提出了一种新的算法来检测和解决分布式系统中的广义死锁。在此算法中,启动器通过沿“等待图”的边缘传播探针来增量构造“本地等待图”(LWFG),并收​​集直接携带进程之间的“等待”关系的回复。它根据确定死锁所拥有的信息来更新LWFG。已提供证明以验证其正确性。所提出的算法具有d  + 2个时间单位的最坏情况下的时间复杂度,以及少于2个e消息的消息复杂度,其中d是直径,e是是WFG中的边数。与现有的集中式算法相比,该集中式算法使用固定大小的消息。仿真结果表明,在死锁持续时间,消息流量和消息长度方面,该算法的性能优于或优于早期的广义死锁检测算法。此外,它无需使用额外的消息回合即可解决死锁,并有效地处理算法的同时执行。

更新日期:2021-02-04
down
wechat
bug