An optimal deadlock resolution algorithm in multidatabase systems

In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of victims for removing deadlocks. It makes the use of network flow techniques, and runs in time O(n3),where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolution algorithm dose not have livelock and transaction processing starvation problems.

• Type: Conference
• Year: 1996
• Where: ICPADS
• Authors: Xuemin Lin, Jian Chen
• Keywords: Deadlock Resolution Algorithm, Distributed And Parallel Computing, Global Deadlocks, ICPADS 1996, Resolution Algorithm Dose