Software Engineering KB

Home

❯

02 Programming Languages and Paradigms

❯

04 Concurrency

❯

01 Concept

❯

Deadlock Detection

Deadlock Detection

Feb 10, 20261 min read

  • concurrency
  • deadlock
  • detection

Deadlock Detection

← Back to Deadlocks & Livelocks

Detecting deadlocks after they occur rather than preventing them. Wait-for graphs track which threads are waiting on which resources; a cycle in this graph indicates deadlock. The system can then recover by killing a thread or releasing resources.

Key Properties

  • Wait-for Graphs
  • Cycle Detection (Deadlock)

concurrency deadlock detection


Graph View

  • Deadlock Detection
  • Key Properties

Backlinks

  • Deadlocks & Livelocks
  • Cycle Detection (Deadlock)
  • Wait-for Graphs
  • Locking

Created with Quartz v4.5.2 © 2026

  • GitHub