Name
Abstract | ||
|---|---|---|
We present an algorithm for analyzing deadlock and for constructing sequentializations of a class of communicating sequential processes. The algorithm may be used for deadlock detection in parallel and distributed programs at compile time, or for debugging purposes at run time. The algorithm generates a data structure we call the flow graph, which contains all you need to know about the communications between the processes. If the algorithm is used only for debugging, it is not necessary to retain a copy of the flow graph. Both static deadlock analysis and trace generation are linear in the size of the (minimum) flow graph we construct. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1145/143369.143417 | ICS |
Keywords | Field | DocType |
timing analysis,deadlock detection,parallel algorithms,data structure,data flow analysis | Edge chasing,Control flow graph,Computer science,Parallel algorithm,Compile time,Parallel computing,Deadlock,Theoretical computer science,Wait-for graph,Deadlock prevention algorithms,Debugging | Conference |
ISBN | Citations | PageRank |
0-89791-485-6 | 7 | 0.85 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter B. Ladkin | 1 | 626 | 90.51 |
| Barbara Simons | 2 | 118 | 74.24 |