Distributed deadlock detection (Q1100883): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Communicating sequential processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank | |||
Normal rank |
Latest revision as of 16:41, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distributed deadlock detection |
scientific article |
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