On robustness of deadlock detection algorithms for distributed computing systems
Badal, Dusan Z.
Gehl, Michael T.
MetadataShow full item record
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)
RightsThis 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.
NPS Report NumberNPS-52-82-001
Showing items related by title, author, creator and subject.
Gehl, Michael T. (1982-06);With the advent of distributed computing systems, the problem of deadlock, which has been essentially solved for centralized computing systems, has reappeared. Existing centralized deadlock detection techniques are either ...
Badal, Dusan Z.; Gehl, Michael J. (Monterey, California. Naval Postgraduate School, 1983-04); NPS-52-83-005With the advent of distributed computing systems, the problem of deadlock, which has been essentially solved for centralized computing systems, has reappeared. Existing centralized deadlock detection techniques are either ...
Smith, Philip B. (Monterey, CA; Naval Postgraduate School, 2022-06);How can we measure and classify neural network robustness across differently distributed data to avoid misuse of machine learning tools? This thesis adopts several metrics to measure the initial condition robustness of ...