A modular drinking philosophers algorithm (Q1261112): Difference between revisions

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.