Cost of distributed deadlock detection: A performance study

Alok N. Choudhary*

*Corresponding author for this work

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

13 Scopus citations

Abstract

A performance evaluation of two classes of distributed deadlock detection algorithms, namely, set-based and probe-based distributed deadlock detection algorithms, is presented. The performance evaluation is performed on a simulated distributed database by implementing the algorithms. The performance evaluation shows two main results. First, the set-based algorithm outperforms the probe-based algorithms. Second, current analytical models of distributed deadlock detection are very optimistic because they only compute the overhead of deadlock detection when deadlock exists. It is shown that this overhead cost is only a small portion of the total overall cost, that is, the cost of running the algorithm when deadlock does not exist dominates the cost of the algorithm when deadlock does exist.

Original languageEnglish (US)
Title of host publicationProceedings - Sixth International Conference on Data Engineering
PublisherPubl by IEEE
Pages174-181
Number of pages8
ISBN (Print)0818620250
StatePublished - Dec 1 1990
EventProceedings - Sixth International Conference on Data Engineering - Los Angeles, CA, USA
Duration: Feb 5 1990Feb 9 1990

Other

OtherProceedings - Sixth International Conference on Data Engineering
CityLos Angeles, CA, USA
Period2/5/902/9/90

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Cost of distributed deadlock detection: A performance study'. Together they form a unique fingerprint.

  • Cite this

    Choudhary, A. N. (1990). Cost of distributed deadlock detection: A performance study. In Proceedings - Sixth International Conference on Data Engineering (pp. 174-181). Publ by IEEE.