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.


Full Text:

PDF


DOI: http://dx.doi.org/10.7146/brics.v3i16.19978
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.
OK


ISSN: 0909-0878 

Hosted by the State and University Library and Aarhus University Library