1996
DOI: 10.7146/brics.v3i16.19978
|View full text |Cite
|
Sign up to set email alerts
|

Detecting Deadlocks in Concurrent Systems

Abstract: We use a geometric description for deadlocks occuring 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
81
0

Year Published

1999
1999
2015
2015

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 39 publications
(81 citation statements)
references
References 3 publications
0
81
0
Order By: Relevance
“…More precisely, extremal points have t 1-coordinates, (n − t − 1) 0-coordinates and a single coordinate is given by t − t . ( denotes Gauss brackets, i.e., t is the largest integer t.) 7 In particular, the point ( t n , . .…”
Section: Proposition 38 Let M Be a Hda The Following Diagram Is Comentioning
confidence: 99%
See 1 more Smart Citation
“…More precisely, extremal points have t 1-coordinates, (n − t − 1) 0-coordinates and a single coordinate is given by t − t . ( denotes Gauss brackets, i.e., t is the largest integer t.) 7 In particular, the point ( t n , . .…”
Section: Proposition 38 Let M Be a Hda The Following Diagram Is Comentioning
confidence: 99%
“…are compact Hausdorff spaces with a closed (global) partial order. More general topological models are needed in general, in which the partial order is only defined locally, and have been introduced and motivated in [7], [5] and [6]. The precise definitions and properties are given in Section 3.1.…”
Section: Introductionmentioning
confidence: 99%
“…1. For so-called semaphore programs (explained below), these progress graphs have been exploited for an algorithmic determination of deadlocs and unreachable states [23,5,9]. A systematic framework for studying schedules of actions of distributed computations by means of geometric properties was proposed by V. Pratt [25] and subsequently R. van Glabbeek [30].…”
Section: Background and Historymentioning
confidence: 99%
“…Even if the po-space X does not have any deadlock point x (i.e., π 1 (X)(x, X 1 ) = ∅ for all x ∈ X, cf. [23,5,9]), the mapping spaces very often have lots of them. If X is the po-space from the left part of Fig.…”
Section: Higher Homotopy Categoriesmentioning
confidence: 99%
“…The "topological" formalization that follows is one of the most recent ones, and essentially dates back to [14] and [15], but is based on much older results [10].…”
Section: • S Is a Set Of States With Initial State I • L Is A Set Of mentioning
confidence: 99%