On robustness of deadlock detection algorithms for distributed computing systems
By: Dushan Z. Badal and Michael T. Gehl
Contributors: Naval Postgraduate School (U.S.); Gehl, Michael T.
Publisher: Naval Postgraduate School
Published: 1982
Place of publication: Monterey, California
Language: eng
Number of pages: 31
Subjects: Electronic data processing; Distributed processing; Reliability; Algorithms; Computer networks
Description: In this paper we investigate the robustness of several deadlock detection algorithms for distributed computing systems. We analyze the behavior of each algorithm in the presence of two classes of failures - lost messages and single site failures. In the case of single site failure we consider six different types of sites depending on how they can participate in deadlock and deadlock detection. The observation and conclusions made in this paper are intended to show how robust the present algorithms are and to provide an insight and better understanding of distributed algorithms robustness. (Author)
Notes: "NPS-52-82-001"--Cover.

Cover title.

"February 1982"--Cover.

"Prepared for: Naval Postgraduate School, Monterey, California 93940."

Includes bibliographical references (p. 29).

"Approved for public release; distribution is unlimited"--Cover.

Technical report; 1982.

ck/ 4/15/09.