Two-phase deadlock detection algorithm

Ahmed Elmagarmid, A. K. Datta

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A deadlock detection algorithm utilizing a transaction-wait-for (TWF) graph is presented. It is a fully distributed algorithm which allows multiple outstanding requests. The proposed algorithm can achieve improved overall performance, using multiple disjoint controllers coupled with the two-phase property, while maintaining the simplicity of centralized schemes. The detection step is divided into two phases. Phase 1 analyzes the condition of the system of interacting transactions, involving phase 2 only if conditions are possible for deadlocks to occur. Phase 2 performs the actual cycle detection. The proposed algorithm can be used in transaction-based distributed processing systems. Some results on the complexity of the algorithm are given.

Original languageEnglish
Pages (from-to)1454-1458
Number of pages5
JournalIEEE Transactions on Computers
Volume37
Issue number11
DOIs
Publication statusPublished - 1 Nov 1988
Externally publishedYes

Fingerprint

Deadlock
Transactions
Distributed Processing
Distributed Algorithms
Parallel algorithms
Simplicity
Disjoint
Controller
Cycle
Controllers
Graph in graph theory
Processing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Two-phase deadlock detection algorithm. / Elmagarmid, Ahmed; Datta, A. K.

In: IEEE Transactions on Computers, Vol. 37, No. 11, 01.11.1988, p. 1454-1458.

Research output: Contribution to journalArticle

Elmagarmid, Ahmed ; Datta, A. K. / Two-phase deadlock detection algorithm. In: IEEE Transactions on Computers. 1988 ; Vol. 37, No. 11. pp. 1454-1458.
@article{0e8d3f484f6548a0bc037a3aa69c859e,
title = "Two-phase deadlock detection algorithm",
abstract = "A deadlock detection algorithm utilizing a transaction-wait-for (TWF) graph is presented. It is a fully distributed algorithm which allows multiple outstanding requests. The proposed algorithm can achieve improved overall performance, using multiple disjoint controllers coupled with the two-phase property, while maintaining the simplicity of centralized schemes. The detection step is divided into two phases. Phase 1 analyzes the condition of the system of interacting transactions, involving phase 2 only if conditions are possible for deadlocks to occur. Phase 2 performs the actual cycle detection. The proposed algorithm can be used in transaction-based distributed processing systems. Some results on the complexity of the algorithm are given.",
author = "Ahmed Elmagarmid and Datta, {A. K.}",
year = "1988",
month = "11",
day = "1",
doi = "10.1109/12.8717",
language = "English",
volume = "37",
pages = "1454--1458",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "11",

}

TY - JOUR

T1 - Two-phase deadlock detection algorithm

AU - Elmagarmid, Ahmed

AU - Datta, A. K.

PY - 1988/11/1

Y1 - 1988/11/1

N2 - A deadlock detection algorithm utilizing a transaction-wait-for (TWF) graph is presented. It is a fully distributed algorithm which allows multiple outstanding requests. The proposed algorithm can achieve improved overall performance, using multiple disjoint controllers coupled with the two-phase property, while maintaining the simplicity of centralized schemes. The detection step is divided into two phases. Phase 1 analyzes the condition of the system of interacting transactions, involving phase 2 only if conditions are possible for deadlocks to occur. Phase 2 performs the actual cycle detection. The proposed algorithm can be used in transaction-based distributed processing systems. Some results on the complexity of the algorithm are given.

AB - A deadlock detection algorithm utilizing a transaction-wait-for (TWF) graph is presented. It is a fully distributed algorithm which allows multiple outstanding requests. The proposed algorithm can achieve improved overall performance, using multiple disjoint controllers coupled with the two-phase property, while maintaining the simplicity of centralized schemes. The detection step is divided into two phases. Phase 1 analyzes the condition of the system of interacting transactions, involving phase 2 only if conditions are possible for deadlocks to occur. Phase 2 performs the actual cycle detection. The proposed algorithm can be used in transaction-based distributed processing systems. Some results on the complexity of the algorithm are given.

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

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

U2 - 10.1109/12.8717

DO - 10.1109/12.8717

M3 - Article

AN - SCOPUS:0024104897

VL - 37

SP - 1454

EP - 1458

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 11

ER -