The distributed deadlock detection algorithm

  • Authors:
  • D. Z. Badal

  • Affiliations:
  • Hewlett-Packard Laboratories, Palo Alto, CA

  • Venue:
  • ACM Transactions on Computer Systems (TOCS)
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a distributed deadlock detection algorithm for distributed computer systems. We consider two types of resources, depending on whether the remote resource lock granularity and mode can or cannot be determined without access to the remote resource site. We present the algorithm, its performance analysis, and an informal argument about its correctness. The proposed algorithm has a hierarchical design intended to detect the most frequent deadlocks with maximum efficiency.