A partially distributed deadlock detection algorithm

Ahmed Elmagarmid, Amit P. Sheth, Ming T. Liu

Research output: Contribution to journalArticle

3 Citations (Scopus)


In this paper, a partially distributed deadlock detection algorithm [PDDDA] with multiple outstanding requests is presented for use in distributed database systems. This algorithm allows a process to request many resources simultaneously and uses a central controller for detecting multisite deadlocks. The detection of local deadlocks and the maintenance of local deadlock information are performed at each of the local sites. This partially distributed algorithm alleviates the problem of congestion at the central controller in a centralized algorithm and needs fewer messages and smaller storage space than a fully decentralized algorithm. A set of criteria for comparing deadlock detection algorithms are also given and then used to compare PDDDA with a fully decentralized algorithm proposed by Isloor and Marsland.

Original languageEnglish
Pages (from-to)307-330
Number of pages24
JournalInternational Journal of Computer & Information Sciences
Issue number5
Publication statusPublished - 1 Oct 1985
Externally publishedYes



  • concurrency control
  • Deadlock detection
  • distributed database systems
  • distributed deadlock detection algorithms
  • performance comparison

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this