On Robustness of Deadlock Detection Algorithms for Distributed Computing Systems.

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1982
Accession Number
ADA112315

Entities

People

  • Dushan Z. Badal
  • Michael T. Gehl

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Computer Science
  • Computers
  • Databases
  • Detection
  • Distributed Computing
  • Military Research
  • Multithreading
  • National Security
  • Observation
  • Operating Systems
  • Reliability
  • Security
  • Technical Information Centers

Fields of Study

  • Computer science
  • Engineering

Readers

  • Computer Networking
  • Sensor Fusion and Tracking Systems.