DocumentCode :
2393053
Title :
An optimal victim selection algorithm for removing global deadlocks in multidatabase systems
Author :
Lin, X. ; Orlowska, M.E. ; Zhang, Y.
Author_Institution :
Dept. of Comput. Sci., Queensland Univ., Brisbane, Qld., Australia
fYear :
1994
fDate :
22-26 Aug 1994
Firstpage :
501
Abstract :
A time out mechanism based on a potential conflict graph has been applied to detect global deadlocks. In order to perform the time out mechanism better, we propose an optimal victim selection algorithm for resolving global deadlock in a multidatabase system. The algorithm selects a set of transactions with the minimal abortion cost to resolve global deadlocks. It makes the use of network flow techniques, and runs in time O(n3), where n is the size of a subset of the global transactions
Keywords :
computational complexity; concurrency control; distributed databases; transaction processing; global deadlock removal; global transactions; minimal abortion cost; multidatabase systems; network flow techniques; optimal victim selection algorithm; potential conflict graph; time out mechanism; Abortion; Communication networks; Computer science; Concurrency control; Concurrent computing; Costs; Database systems; Scheduling; System recovery; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994
Print_ISBN :
0-7803-1862-5
Type :
conf
DOI :
10.1109/TENCON.1994.369250
Filename :
369250
Link To Document :
بازگشت