FAULT TOLERANT DEADLOCK DETECTION IN DISTRIBUTED DATABASE SYSTEMS.

Ahmed K. Elmagarmid*, Ming T. Liu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

The availability of distributed databases is directly affected by the timely detection and resolution of deadlocks. Consequently, mechanisms are needed to make deadlock-detection algorithms resilient to failures. A new distributed deadlock-detection algorithm (DDDA) which uses a global detector to detect global deadlocks and local detectors to detect local deadlocks is presented. The algorithm essentially identifies transaction-resource interactions that may cause global (multisite) deadlocks. Such interactions are reported to the global controller, while the remaining interactions are handled locally. In order to make the DDDA fault-tolerant, three procedures have been incorporated to handle failures of the controller, local sites, and communication links. This enhanced algorithm, called FTDDDA, improves the overall performance of the database system by improving resiliency of the deadlock-detection service.

Original languageEnglish
Title of host publicationDigest of Papers - FTCS (Fault-Tolerant Computing Symposium)
PublisherIEEE
Pages240-245
Number of pages6
ISBN (Print)0818606185
Publication statusPublished - 1985
Externally publishedYes

Publication series

NameDigest of Papers - FTCS (Fault-Tolerant Computing Symposium)
ISSN (Print)0731-3071

Fingerprint

Dive into the research topics of 'FAULT TOLERANT DEADLOCK DETECTION IN DISTRIBUTED DATABASE SYSTEMS.'. Together they form a unique fingerprint.

Cite this