Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Distributed deadlock models are presented for resource and communication deadlocks. Simple distributed algorithms for detection of these deadlocks are given. We show that all true deadlocks are detected and that no false deadlocks are reported. In our algorithms, no process maintains global information; all messages have an identical short length. The algorithms can be applied in distributed database and other message communication systems. © 1983, ACM. All rights reserved.
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Preeti Malakar, Thomas George, et al.
SC 2012
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Elliot Linzer, M. Vetterli
Computing