A distributed deadlock detection algorithm for the AND model

https://doi.org/10.1016/0165-6074(93)90171-GGet rights and content

Abstract

This paper∗ introduces a simple and efficient distributed deadlock detection algorithm for a Distributed Database System with AND model. The algorithm is derived from a previous algorithm for the One-Resource model. By using a formal specification based on Automata Theory, the proof of correctness is provided: the algorithm reports all true deadlocks and does not report false deadlocks.

References (10)

  • J.R. González de Mendívil et al.

    A simple Distributed Deadlock Detection Algorithm

  • E. Knapp

    Deadlock Detection in Distributed Databases

    ACM Computing Surveys

    (Dec. 1988)
  • M. Singhal

    Deadlock Detection in Distributed Systems

    IEEE Computer

    (Nov. 1989)
  • D. Zöbel et al.

    Resolution techniques and complexity results with Deadlocks. A classifying and annotated bibliography

    Operating System Review

    (Jan. 1988)
  • D.A. Menasce et al.

    Locking and Deadlock Detection in Distributed Databases

    IEEE Transactions on Software Engineering

    (May. 1979)
There are more references available in the full text version of this article.

Cited by (2)

∗

The work has been supported by a research grant of the University of the Basque Country.

View full text
Copyright © 1993 Published by Elsevier B.V.