PRIORITY BASED PROBE ALGORITHM FOR DISTRIBUTED DEADLOCK DETECTION AND RESOLUTION.

A. N. Choudhary*, W. H. Kohler, J. A. Stankovic, D. Towsley

*Corresponding author for this work

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

4 Scopus citations

Abstract

K. M. Chandy, J. Misra, and L. M. Haas (1983), as well as M. K. Sinha and N. Natarajan (1985), proposed a priority-based probe algorithm for deadlock detection and resolution in distributed database systems. It is shown with the aid of examples that their priority-based algorithm either fails to detect deadlocks or in many situations reports deadlocks which do not exist. A modified algorithm which eliminates these problems is presented. The correctness of the current algorithm has been tested through simulation. The performance of the modified algorithm is discussed.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
EditorsR. Popescu-Zeletin, G. Le Lann, K.H. Kim
PublisherIEEE
Pages162-168
Number of pages7
ISBN (Print)0818608013
StatePublished - Dec 1 1987
EventProc Int Conf Distrib Comput Syst 7th - Berlin, West Ger
Duration: Sep 21 1987Sep 25 1987

Other

OtherProc Int Conf Distrib Comput Syst 7th
CityBerlin, West Ger
Period9/21/879/25/87

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'PRIORITY BASED PROBE ALGORITHM FOR DISTRIBUTED DEADLOCK DETECTION AND RESOLUTION.'. Together they form a unique fingerprint.

Cite this