ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Distributed deadlock detection algorithm
Full text PdfPdf (1.55 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 7 ,  Issue 2  (June 1982) table of contents
Pages: 187 - 208  
Year of Publication: 1982
ISSN:0362-5915
Author
Ron Obermarck  IBM, San Jose, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 227,   Citation Count: 46
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/319702.319717
What is a DOI?

ABSTRACT

We propose an algorithm for detecting deadlocks among transactions running concurrently in a distributed processing network (i.e., a distributed database system). The proposed algorithm is a distributed deadlock detection algorithm. A proof of the correctness of the distributed portion of the algorithm is given, followed by an example of the algorithm in operation. The performance characteristics of the algorithm are also presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
GLIGOR, V.D., AND SHATTUCK, S.H. On deadlock detection in distributed systems. Computer Science Tech. Rep. 837, University of Maryland, College Park, Md., Dec. 1979.
 
2
 
3
 
4
GRAY, J.N. A discussion of distributed systems. Res. Rep. RJ2699(34594), IBM Research Division, Sept. 1979.
 
5
GRAY, J.N., HOMAN, P., OBE~ARCK, R., AND KORTH, H. A straw man analysis of probability of waiting and deadlock. Res. Rep. RJ3066(38112), IBM Research Division, Feb. 1981 (presented at the 5th Berkeley Workshop on Distributed Data Management and Computer Networks, Feb. 198i).
 
6
JOHNSON, D.B. Finding all the elementary cycles of a directed graph. SIAM Comput. 4, 1 (March 1975), 77-84.
 
7
MENASCE, D., AND MUNTZ, R. Locking and deadlock detection in distributed data bases. IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 195-202.
 
8
OBERMARCK, R. Distributed data base. IBM Palo Alto Systems Center Tech. Bull. G320-6019, IBM, Palo Alto, Calif., Sept. 1978.
9

CITED BY  46