loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
6th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS '97)
Towards an efficient probabilistic deadlock detection method for multidatabase systems
Tunis, TUNISIA
October 29-October 31
ISBN: 0-8186-8153-5
ASCII Text
x 
 
K. Barkaoui, R. Benamara, "Towards an efficient probabilistic deadlock detection method for multidatabase systems," Future Trends of Distributed Computing Systems, IEEE International Workshop, pp. 84, 6th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS '97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/FTDCS.1997.644708,
author = {K. Barkaoui and R. Benamara},
title = {Towards an efficient probabilistic deadlock detection method for multidatabase systems},
journal ={Future Trends of Distributed Computing Systems, IEEE International Workshop},
volume = {0},
year = {1997},
issn = {1071-0485},
pages = {84},
doi = {http://doi.ieeecomputersociety.org/10.1109/FTDCS.1997.644708},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Future Trends of Distributed Computing Systems, IEEE International Workshop
TI - Towards an efficient probabilistic deadlock detection method for multidatabase systems
SN - 1071-0485
SP
EP
A1 - K. Barkaoui,
A1 - R. Benamara,
PY - 1997
KW - concurrency control; probabilistic deadlock detection method; multidatabase systems; local transaction visibility; local systems autonomy; contention; PCG method; mean condition; random graph theory; random deadlock detection; performance; concurrency control
VL - 0
JA - Future Trends of Distributed Computing Systems, IEEE International Workshop
ER -
 
K. Barkaoui, Lab. CEDRIC, CNAM, Paris, France
R. Benamara, Lab. CEDRIC, CNAM, Paris, France
Deadlock detection is an important issue in multidatabase systems. Due to the autonomy of the local systems, the visibility of the state of local transactions and the contention on items is not available. The well known PCG method exploits a weaker mean condition to detect potential global deadlock, that does not necessarily correspond to a real one. We present a probabilistic analysis of PCG using random graph theory and establish the foundations of a new method called random deadlock detection (RDD) for which implementation and performance should be better.
Index Terms:
concurrency control; probabilistic deadlock detection method; multidatabase systems; local transaction visibility; local systems autonomy; contention; PCG method; mean condition; random graph theory; random deadlock detection; performance; concurrency control
Citation:
K. Barkaoui, R. Benamara, "Towards an efficient probabilistic deadlock detection method for multidatabase systems," ftdcs, pp.84, 6th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.