An optimal deadlock resolution algorithm in multidatabase systems

Xuemin Lin, Jian Chen

Abstract: 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 use of network flow techniques, and runs in time O(n/sup 3/), where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolution algorithm does not have livelock and transaction processing starvation problems.