Efficient detection and resolution of generalized distributed deadlocks

Author

Kshemkalyani, Ajay D. ; Singhal, Mukesh

Author_Institution

IBM Corp., Research Triangle Park, NC, USA

Volume

20

Issue

1

fYear

1994

fDate

1/1/1994 12:00:00 AM

Firstpage

43

Lastpage

54

Abstract

We present an efficient one-phase algorithm that consists of two concurrent sweeps of messages to detect generalized distributed deadlocks. In the outward sweep, the algorithm records a snapshot of a distributed wait-for-graph (WFG). In the inward sweep, the algorithm performs reduction of the recorded distributed WFG to check for a deadlock. The two sweeps can overlap in time at a process. We prove the correctness of the algorithm. The algorithm has a worst-case message complexity of 4e-2n+2l and a time complexity of 2d hops, where e is the number of edges, n is the number of nodes, l is the number of leaf nodes, and d is the diameter of the WFG. This is a notable improvement over the existing algorithms to detect generalized deadlocks

Keywords

computational complexity; concurrency control; directed graphs; operating systems (computers); algorithm correctness; concurrent sweeps; directed graph; distributed snapshot; distributed system; distributed wait-for-graph; generalized distributed deadlock detection; generalized distributed deadlock resolution; graph reduction; inward sweep; leaf nodes; messages; one-phase algorithm; outward sweep; time complexity; worst-case message complexity; Algorithm design and analysis; Associate members; Detection algorithms; Information science; Phase detection; Software algorithms; Sufficient conditions; System recovery; Topology;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.263754

Filename

263754