Towards an efficient probabilistic deadlock detection method for multidatabase systems - Archive ouverte HAL Access content directly
Conference Papers Year : 1997

Towards an efficient probabilistic deadlock detection method for multidatabase systems

Abstract

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. Voir le lien ici
No file

Dates and versions

hal-01125462 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01125462 , version 1

Cite

Kamel Barkaoui, R. Benamara. Towards an efficient probabilistic deadlock detection method for multidatabase systems. 6th Workshop on Future Trends of Distributed Computing Syst. FTDCS'97, Jan 1997, X, France. pp.84-91. ⟨hal-01125462⟩

Collections

CNAM CEDRIC-CNAM
15 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More