DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS.

Ahmed Elmagarmid, Ajoy K. Datta, Ming T. Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (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 conditions of the system of interacting transactions, invoking phase 2 only if conditions are possible for deadlocks to occur. The proposed algorithm can be used in distributed database systems as well as in transaction-processing systems.

Original languageEnglish
Title of host publicationProceedings - IEEE Computer Society's International Computer Software & Applications Conference
Place of PublicationNew York, NY, USA
PublisherIEEE
Pages81-90
Number of pages10
ISBN (Print)0818605502
Publication statusPublished - 1 Dec 1984
Externally publishedYes

Fingerprint

Processing
Distributed database systems
Parallel algorithms
Controllers

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Elmagarmid, A., Datta, A. K., & Liu, M. T. (1984). DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS. In Proceedings - IEEE Computer Society's International Computer Software & Applications Conference (pp. 81-90). New York, NY, USA: IEEE.

DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS. / Elmagarmid, Ahmed; Datta, Ajoy K.; Liu, Ming T.

Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. New York, NY, USA : IEEE, 1984. p. 81-90.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Elmagarmid, A, Datta, AK & Liu, MT 1984, DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS. in Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. IEEE, New York, NY, USA, pp. 81-90.
Elmagarmid A, Datta AK, Liu MT. DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS. In Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. New York, NY, USA: IEEE. 1984. p. 81-90
Elmagarmid, Ahmed ; Datta, Ajoy K. ; Liu, Ming T. / DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS. Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. New York, NY, USA : IEEE, 1984. pp. 81-90
@inproceedings{cf7ebfb3d8724b7da7629ebc99ae8c29,
title = "DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS.",
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 conditions of the system of interacting transactions, invoking phase 2 only if conditions are possible for deadlocks to occur. The proposed algorithm can be used in distributed database systems as well as in transaction-processing systems.",
author = "Ahmed Elmagarmid and Datta, {Ajoy K.} and Liu, {Ming T.}",
year = "1984",
month = "12",
day = "1",
language = "English",
isbn = "0818605502",
pages = "81--90",
booktitle = "Proceedings - IEEE Computer Society's International Computer Software & Applications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS.

AU - Elmagarmid, Ahmed

AU - Datta, Ajoy K.

AU - Liu, Ming T.

PY - 1984/12/1

Y1 - 1984/12/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 conditions of the system of interacting transactions, invoking phase 2 only if conditions are possible for deadlocks to occur. The proposed algorithm can be used in distributed database systems as well as in transaction-processing systems.

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 conditions of the system of interacting transactions, invoking phase 2 only if conditions are possible for deadlocks to occur. The proposed algorithm can be used in distributed database systems as well as in transaction-processing systems.

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

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

M3 - Conference contribution

SN - 0818605502

SP - 81

EP - 90

BT - Proceedings - IEEE Computer Society's International Computer Software & Applications Conference

PB - IEEE

CY - New York, NY, USA

ER -