|
|
|
@inproceedings{DBLP:conf/vldb/KawazuMIT79,
author = {Seiichi Kawazu and
Susumu Minami and
Kenji Itoh and
Katsuni Teranaka},
editor = {Antonio L. Furtado and
Howard L. Morgan},
title = {Two-Phase Deadlock Detection Algorithm in Distributed Databases},
booktitle = {Fifth International Conference on Very Large Data Bases, October
3-5, 1979, Rio de Janeiro, Brazil, Proceedings},
publisher = {IEEE Computer Society},
year = {1979},
pages = {360-367},
ee = {db/conf/vldb/KawazuMIT79.html},
crossref = {DBLP:conf/vldb/79},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
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 deadlock 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.
Copyright © 1979 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.
