The Community for Technology Leaders
Green Image
Issue No. 11 - November (1988 vol. 37)
ISSN: 0018-9340
pp: 1454-1458
ABSTRACT
A deadlock detection algorithm utilizing a transaction-wait-for (TWF) graph is presented. It is a fully distributed algorithm which allows multiple outstanding requests. The proposed algorithm can achieve improved overall performance, using multiple disjoint controllers coupled with the two-phase property, while maintaining the simplicity of centralized schemes. The detection step is divided in
INDEX TERMS
deadlock detection algorithm; transaction-wait-for; distributed algorithm; multiple disjoint controllers; two-phase property; detection step; deadlocks; actual cycle detection; transaction-based distributed processing systems; distributed databases; distributed processing; transaction processing.
CITATION

A. Datta and A. Elmagarmid, "Two-Phase Deadlock Detection Algorithm," in IEEE Transactions on Computers, vol. 37, no. , pp. 1454-1458, 1988.
doi:10.1109/12.8717
94 ms
(Ver 3.3 (11022016))