A modular drinking philosophers algorithm (Q1261112): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jennifer Lundelius Welch / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Nancy A. Lynch / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Luboš Brim / rank | |||
Normal rank | |||
Revision as of 13:23, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modular drinking philosophers algorithm |
scientific article |
Statements
A modular drinking philosophers algorithm (English)
0 references
16 September 1993
0 references
A variant of the drinking philosophers algorithm of Chandy and Misra is described and proved correct in a modular way. The algorithm uses an arbitrary dining philosophers algorithm as a subroutine. For \(O(1)\) time subroutine, the worst-case waiting time of the presented algorithms is shown to be \(O(1)\). Definitions that distinguish the drinking and dining philosophers problem and that specify varying degrees of concurrency are provided.
0 references
allocation
0 references
drinking philosophers
0 references
dining philosophers
0 references
concurrency
0 references
