A robust distributed solution to the dining philosophers problem
Thomas A. Cargill · Software Practice and Experience · 1982
Abstract A distributed solution to Dijkstra's ‘Dining Philosophers’ problem is presented. There is no central synchronization mechanism and it is robust in that the impact of failures is local. The solution is amenable to implementation using a wide class of synchronization primitives. A concrete implementation is presented in Ada.