An efficient distributed deadlock detection algorithm

We propose a distributed deadlock detection algorithm which detects cycles made of back edges in a distributed search tree. Our algorithm detects the deadlocks in which the initiator of the algorithm is directly or indirectly involved, while most of the proposed deadlock detection algorithms only de...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of 15th International Conference on Distributed Computing Systems pp. 169 - 178
Main Authors: Soojung Lee, Kim, J.L.
Format: Conference Proceeding
Language:English
Published: IEEE 1995
Subjects:
Detection algorithms
Probes
System recovery
ISBN:9780818670251, 0818670258
ISSN:1063-6927
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a distributed deadlock detection algorithm which detects cycles made of back edges in a distributed search tree. Our algorithm detects the deadlocks in which the initiator of the algorithm is directly or indirectly involved, while most of the proposed deadlock detection algorithms only detect the cycles in which the initiator is directly involved. Our algorithm is a reduced version of the one proposed previously, which resolves all deadlocks reachable from the initiator in a single execution by propagating the probe messages to the nodes in the search tree and having each node resolve deadlocks in its subtree with collected information on dependency between its subtree nodes. Our algorithm substantially reduces the message overhead of the previous algorithm. We compare the performance of our algorithm with others through extensive simulation. It is found that our algorithm detects deadlocks as fast as the previous algorithm with much fewer messages. The simulation results show that our algorithm outperforms other algorithms considerably in major performance measures.
ISBN:9780818670251
0818670258
ISSN:1063-6927
DOI:10.1109/ICDCS.1995.500016