An optimal distributed solution to the dining philosphers problem (Q1100887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal distributed solution to the dining philosphers problem |
scientific article; zbMATH DE number 4045124
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal distributed solution to the dining philosphers problem |
scientific article; zbMATH DE number 4045124 |
Statements
An optimal distributed solution to the dining philosphers problem (English)
0 references
1986
0 references
An optimal distributed solution to the dining philosophers problem is presented. The solution is optimal in the sense that it incurs the least communication and computational overhead, and allows the maximum achievable concurrency. The worst case upper bound for concurrency is shown to be n div 3, n being the number of philosophers. There is no previous algorithm known to achieve this bound.
0 references
distributed algorithms
0 references
performance analysis
0 references
resource allocation
0 references
dining philosophers
0 references
concurrency
0 references
