Detecting Deadlocks in Concurrent Systems
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
How to Cite
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.