On robustness of deadlock detection algorithms for distributed computing systems
Loading...
Authors
Badal, Dusan Z.
Gehl, Michael T.
Subjects
Robustness
Reliability
Deadlock Detection
Distributed Computing Systems
Failures
Reliability
Deadlock Detection
Distributed Computing Systems
Failures
Advisors
Date of Issue
1982-02
Date
1982-02
Publisher
Monterey, California. Naval Postgraduate School
Language
Abstract
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)
Type
Technical Report
Description
Series/Report No
Department
Organization
Identifiers
NPS Report Number
NPS-52-82-001
Sponsors
Prepared for: Naval Postgraduate School, Monterey, California 93940.
Funding
N0001482WR20043
Format
31 p. : ill. ; 28 cm.
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.