Locking and Deadlock Detection in Distributed Data Bases

This paper descrbes two protocols for the detection of deadlocks in distributed data bases-a hierarchically organized one and a distributed one. A graph model which depicts the state of execution of all transactions in the system is used by both protocols. A cycle in this graph is a necessary and su...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on software engineering Vol. SE-5; no. 3; pp. 195 - 202
Main Authors Menasce, D.A., Muntz, R.R.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.05.1979
IEEE Computer Society
Subjects
Computer science
Concurrent computing
Cost function
Data bases
Data processing
deadlock detection
distributed data bases
Distributed processing
Graph theory
Graphs
Multiprocessing systems
Protocol
Protocols
Scale models
Software engineering
Sufficient conditions
System recovery
Theory
Tin
Topology
Online AccessGet full text

Cover

More Information
Summary:This paper descrbes two protocols for the detection of deadlocks in distributed data bases-a hierarchically organized one and a distributed one. A graph model which depicts the state of execution of all transactions in the system is used by both protocols. A cycle in this graph is a necessary and sufficient condition for a deadlock to exist. Nevertheless, neither protocol requires that the global graph be built and maintained in order for deadlocks to be detected. In the case of the hierarchical protocol, the communications cost can be optimized if the topology of the hierarachy is appropriately chosen.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1979.234181