FAULT-TOLERANT DEADLOCK DETECTION IN DISTRIBUTED DATABASE SYSTEMS.

Ahmed K. Elmagarmid*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

A new distributed deadlock detection algorithm (DDDA) is presented that uses both a global detector (GD) to detect global deadlocks and local detectors (LDs) to detect local deadlocks. The algorithms 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, of any local sites, and of communication links. This enhanced algorithm, called FTDDDA, improves the overall performance of the database system by improving the resiliency of the deadlock detection service.

Original languageEnglish
Pages (from-to)16-28
Number of pages13
JournalComputer Systems Science and Engineering
Volume2
Issue number1
Publication statusPublished - Jan 1987
Externally publishedYes

Fingerprint

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

Cite this