Affiliation:
1. Hewlett-Packard Laboratories, Palo Alto, CA
Abstract
We propose a distributed deadlock detection algorithm for distributed computer systems. We consider two types of resources, depending on whether the remote resource lock granularity and mode can or cannot be determined without access to the remote resource site. We present the algorithm, its performance analysis, and an informal argument about its correctness. The proposed algorithm has a hierarchical design intended to detect the most frequent deadlocks with maximum efficiency.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Implementing remote procedure calls
2. On Deadlock Detection in Distributed Systems
3. GRAY J. HOMAN P. KORTH H. AND OBERMARCK R. A straw man analysis of the probability of waiting and deadlock in a distributed database system. Paper presented at 5th Berkeley Workshop on Distributed Data Management and Computer Networks (San Francisco February). Lawrence Berkeley Laboratory University of California Berkeley and U.S. Department of Energy 1981. GRAY J. HOMAN P. KORTH H. AND OBERMARCK R. A straw man analysis of the probability of waiting and deadlock in a distributed database system. Paper presented at 5th Berkeley Workshop on Distributed Data Management and Computer Networks (San Francisco February). Lawrence Berkeley Laboratory University of California Berkeley and U.S. Department of Energy 1981.
4. Locking and Deadlock Detection in Distributed Data Bases
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献