Detecting Deadlocks in Concurrent Systems

  • Lisbeth Fajstrup
  • Martin Raussen

Abstract

We use a geometric description for deadlocks occurring in scheduling
problems for concurrent systems to construct a partial order and hence a directed graph, in which the local maxima correspond to deadlocks. Algorithms finding deadlocks are described and assessed.

Keywords: deadlock, partial order, search algorithm, concurrency, distributed
systems.

Published
1996-01-16
How to Cite
Fajstrup, L., & Raussen, M. (1996). Detecting Deadlocks in Concurrent Systems. BRICS Report Series, 3(16). https://doi.org/10.7146/brics.v3i16.19978