An optimal deadlock resolution algorithm in multidatabase systems
Lists
Only you see this
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.
BibTeX
@inproceedings{lin1996optimal,
author = {Xuemin Lin and Jian Chen},
title = {{An optimal deadlock resolution algorithm in multidatabase systems}},
booktitle = {ICPADS},
year = {1996},
doi = {10.1109/icpads.1996.517602},
}Loading related content...