DocumentCode
298106
Title
An optimal deadlock resolution algorithm in multidatabase systems
Author
Lin, Xuemin ; Chen, Jian
Author_Institution
Dept. of Comput. Sci., Western Australia Univ., Nedlands, WA, Australia
fYear
1996
fDate
3-6 Jun 1996
Firstpage
516
Lastpage
521
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 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
Keywords
concurrency control; distributed databases; transaction processing; deadlock resolution; global deadlocks; global transactions; multidatabase system; multidatabase systems; transaction processing; Communication networks; Computer science; Concurrency control; Concurrent computing; Costs; Database systems; Programming; Software development management; System recovery; Transaction databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 1996. Proceedings., 1996 International Conference on
Conference_Location
Tokyo
Print_ISBN
0-8186-7267-6
Type
conf
DOI
10.1109/ICPADS.1996.517602
Filename
517602
Link To Document