Affiliation:
1. National Tsing-Hua Univ., Hsinchu, Taiwan
Abstract
An algorithm for detecting deadlocks in distributed systems with CSP-like communication is proposed. Unlike previous work, the proposed algorithm avoids
periodically
sending deadlock-detecting messages by the processes and requires no local storage for the processes with size predetermined by the number of processes in the system. The algorithm is proven to have the following properties: (0) it never detects
false
deadlocks; (1) it has only one process in a
knot
report the deadlock; and (2) it detects every
true
deadlock in finite time.
Publisher
Association for Computing Machinery (ACM)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. GoBench: A Benchmark Suite of Real-World Go Concurrency Bugs;2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO);2021-02-27
2. Static deadlock detection for concurrent go by global session graph synthesis;Proceedings of the 25th International Conference on Compiler Construction;2016-03-17
3. Static Trace-Based Deadlock Analysis for Synchronous Mini-Go;Programming Languages and Systems;2016
4. Ordinary Differential Equation-Based Deadlock Detection;IEEE Transactions on Systems, Man, and Cybernetics: Systems;2014-10
5. Deadlock detection and recovery for component-based systems;Mathematical and Computer Modelling;2013-09