Two-Phase Deadlock Detection Algorithm In Distributed Databases

There are two deadlock detection methods in a distributed database. One is centralized, and the other is distributed. In this paper a distributed method is discussed. Sub-Wait-Graphs, which express the state of execution of transactions in individual sites, are introduced, and a sufficient condition...

Full description

Saved in:
Bibliographic Details
Published inFifth International Conference on Very Large Data Bases, 1979 pp. 360 - 367
Main Authors Kawazu, S., Minami, S., Itoh, K., Teranaka, K.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1979
Subjects
Data processing
Detection algorithms
Distributed databases
Laboratories
Partitioning algorithms
Phase detection
Sufficient conditions
System recovery
Terminology
Transaction databases
Online AccessGet full text
DOI10.1109/VLDB.1979.718152

Cover

More Information
Summary:There are two deadlock detection methods in a distributed database. One is centralized, and the other is distributed. In this paper a distributed method is discussed. Sub-Wait-Graphs, which express the state of execution of transactions in individual sites, are introduced, and a sufficient condition for a global deadlock not to occur is given, based on the Sub-Wait-Graph. This sufficient condition makes it possible for a deadlock detection to be separated into two phases, local deadlock detection and global dead-lock detection. Also, an efficient deadlock detection algorithm, which requires to be built and maintain only Sub-Wait-Graphs, is proposed, by making use of this property. The characteristics and effects of this algorithm are discussed.
DOI:10.1109/VLDB.1979.718152