DISTRIBUTED DEADLOCK DETECTION ALGORITHM IN TRANSACTION-PROCESSING SYSTEMS.

Ahmed K. 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
PublisherIEEE
Pages81-90
Number of pages10
ISBN (Print)0818605502
Publication statusPublished - 1 Dec 1984

Publication series

NameProceedings - IEEE Computer Society's International Computer Software & Applications Conference

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

Cite this

Elmagarmid, A. K., 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). (Proceedings - IEEE Computer Society's International Computer Software & Applications Conference). IEEE.