Open AccessDetecting Deadlocks in Concurrent Systems
Author(s) -
Lisbeth Fajstrup,
Martin Raußen
Publication year - 1996
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v3i16.19978
Subject(s) - concurrency , deadlock , computer science , scheduling (production processes) , graph , deadlock prevention algorithms , concurrency control , distributed computing , parallel computing , theoretical computer science , mathematics , mathematical optimization , programming language , database transaction
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.