A partially distributed deadlock detection algorithm

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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
Volume14
Issue number5
DOIs
Publication statusPublished - 1 Oct 1985
Externally publishedYes

Fingerprint

Deadlock
Decentralized
Distributed database systems
Distributed Database System
Controller
Controllers
Distributed Algorithms
Parallel algorithms
Congestion
Maintenance
Resources

Keywords

  • 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

A partially distributed deadlock detection algorithm. / Elmagarmid, Ahmed; Sheth, Amit P.; Liu, Ming T.

In: International Journal of Computer & Information Sciences, Vol. 14, No. 5, 01.10.1985, p. 307-330.

Research output: Contribution to journalArticle

@article{dc67ed8d26264568a664fd454e5fd7e0,
title = "A partially distributed deadlock detection algorithm",
abstract = "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.",
keywords = "concurrency control, Deadlock detection, distributed database systems, distributed deadlock detection algorithms, performance comparison",
author = "Ahmed Elmagarmid and Sheth, {Amit P.} and Liu, {Ming T.}",
year = "1985",
month = "10",
day = "1",
doi = "10.1007/BF00987040",
language = "English",
volume = "14",
pages = "307--330",
journal = "International Journal of Parallel Programming",
issn = "0885-7458",
publisher = "Springer New York",
number = "5",

}

TY - JOUR

T1 - A partially distributed deadlock detection algorithm

AU - Elmagarmid, Ahmed

AU - Sheth, Amit P.

AU - Liu, Ming T.

PY - 1985/10/1

Y1 - 1985/10/1

N2 - 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.

AB - 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.

KW - concurrency control

KW - Deadlock detection

KW - distributed database systems

KW - distributed deadlock detection algorithms

KW - performance comparison

UR - http://www.scopus.com/inward/record.url?scp=2842595050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2842595050&partnerID=8YFLogxK

U2 - 10.1007/BF00987040

DO - 10.1007/BF00987040

M3 - Article

VL - 14

SP - 307

EP - 330

JO - International Journal of Parallel Programming

JF - International Journal of Parallel Programming

SN - 0885-7458

IS - 5

ER -