The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - May (1979 vol.5)
pp: 195-202
D.A. Menasce , Department of Computer Science, University of California
ABSTRACT
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.
INDEX TERMS
graph theory, Data bases, deadlock detection, distributed data bases
CITATION
D.A. Menasce, R.R. Muntz, "Locking and Deadlock Detection in Distributed Data Bases", IEEE Transactions on Software Engineering, vol.5, no. 3, pp. 195-202, May 1979, doi:10.1109/TSE.1979.234181
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool