Detecting Deadlocks in Concurrent Systems
DOI:
https://doi.org/10.7146/brics.v3i16.19978Resumé
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.
Downloads
Publiceret
1996-01-16
Citation/Eksport
Fajstrup, L., & Raussen, M. (1996). Detecting Deadlocks in Concurrent Systems. BRICS Report Series, 3(16). https://doi.org/10.7146/brics.v3i16.19978
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
