Any system that allows sharing of resources is subject to the possibility of a deadlock. A
deadlock occurs when a set of transactions waits, in circular fashion, for exclusive access to
some of the resources which are held by some other transactions in the same set. Three
different classes of deadlock detection algorithms are presented. The first algorithm is based
on a centralized scheme in which all the deadlocks are handled through a central controller.
The centralized deadlock detection is based on a structured transaction-resource …

Distributed deadlock detection can require significant overhead, adversely aifecting the
performance of a distributed database system. SET-based and probe based algorithm have
been touted as the more efficient distributed deadlock detection algorithms known. This
paper first presents optimizations that enhance the performance of the SET-based approach.
A performance analysis is then performed which shows two main results. One, the new SET-
based algorithm outperforms probe based algorithms. Two, current analytical models of …