Distributed deadlock detection (Q1100883)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed deadlock detection |
scientific article; zbMATH DE number 4045119 |
Statements
Distributed deadlock detection (English)
0 references
1987
0 references
We describe a simple and efficient algorithm to detect deadlocks in distributed systems. In our model, processes request N resources from a pool of size M. This is a generalization of the well known AND-OR request model. The algorithm is incrementally derived and proven correct. Its communication, computational, and space requirements are lower than those of the best previously known algorithms for the simpler AND-OR model.
0 references
deadlocks
0 references
distributed systems
0 references
AND-OR request model
0 references
0.8675413727760315
0 references
0.8638374209403992
0 references
0.8293150663375854
0 references
0.8272360563278198
0 references
