LOCKING AND DEADLOCK DETECTION IN DISTRIBUTED DATA-BASES

被引:55
作者
MENASCE, DA
MUNTZ, RR
机构
[1] Department of Computer Science, University of California, Los Angeles
关键词
deadlock detection; distributed data bases; graph theory; Index Terms-Data bases;
D O I
10.1109/TSE.1979.234181
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper describes 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. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.
引用
收藏
页码:195 / 202
页数:8
相关论文
共 6 条
[1]  
Haberman A.N., Prevention of system deadlocks, Commun. Ass. Comput. Mach., 12, 7, pp. 373-377, (1969)
[2]  
Shoshani A., Coffman E.G., Sequencing tasks in multi-process, process, multiple resource systems to avoid deadlocks, Proc. 11th Annual Symp. on Switching and Automata Theory, pp. 225-233, (1970)
[3]  
Coffman E.G., Elphick M.J., Shoshani A., System dead-locks, ACM Comput. Surveys, 3, 2, pp. 67-78, (1971)
[4]  
King P.F., Collmeyer A.J., Database sharing-An efficient mechanism for supporting concurrent processes, Proc. AFIPS Nat. Comput. Conf., (1973)
[5]  
Gray J.N., Notes on database operating systems, Operating Systems and Advanced Course, pp. 394-481, (1978)
[6]  
Eswaran K.P., Gray J.N., Lorie R.A., Traiger I.L., The motions of consistency and predicate locks in a database system, Commun. Ass. Comput. Mach., 19, 11, (1976)