Self-stabilizing deadlock detection algorithms

Authors:
Mitchell Flatebo;Ajoy Kumar Datta
Affiliations:
Department of Computer Science, University of Nevada, Las Vegas, NV;Department of Computer Science, University of Nevada, Las Vegas, NV
Venue:
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Year:
1992

Citing 4
Cited 2

Deadlock detection in distributed databases

ACM Computing Surveys (CSUR)
Deadlock Detection in Distributed Systems

Computer
Distributed deadlock detection

ACM Transactions on Computer Systems (TOCS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM

The generalized deadlock resolution problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Self-stabilizing deadlock detection under the OR requirement model

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A distributed system consists of a set of loosely connected state machines which do not share a global memory. All the possible global states of the system can be split up into legal and illegal states. A self-stabilizing system is a network of processors, which, when started from an arbitrary (and possibly illegal) initial state, always returns to a legal state in a finite number of steps. Self-stabilization has already been applied to some areas of distributed systems such as mutual exclusion, communication protocols, leader election, etc. [3][4]. This paper will present self-stabilizing deadlock detection algorithms, for single and multiple outstanding requests. Self-stabilizing methods for deadlock resolution and prevention are also discussed.