The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Understanding fault-tolerant distributed systems
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Restricted failure detectors: definition and reduction protocols
Information Processing Letters
"Gamma-Accurate" Failure Detectors
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Fast allocation of nearby resources in a distributed system
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A necessary and sufficient condition for transforming limited accuracy failure detectors
Journal of Computer and System Sciences
Dining Philosophers with Crash Locality 1
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Distributed resource allocation with scalable crash containment
Distributed resource allocation with scalable crash containment
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Eventually k-Bounded Wait-Free Distributed Daemons
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
The weakest failure detectors to boost obstruction-freedom
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Eventually perfect failure detectors using ADD channels
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
The weakest failure detector for wait-free dining under eventual weak exclusion
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Crash-quiescent failure detection
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Failure detectors encapsulate fairness
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
| Hi-index | 0.00 |
We present a wait-free solution to the generalized dining philosophers problem under eventual weak exclusion in environments subject to crash faults. Wait-free dining guarantees that every correct hungry process eventually eats, regardless of process crashes. Eventual weak exclusion (◊WX) actually allows scheduling mistakes, whereby mutual exclusion may be violated finitely-many times; for each run, however, there must exist a convergence point after which live neighbors never eat simultaneously. Wait-free dining under ◊WX is particularly useful for synchronization tasks where eventual safety is sufficient for correctness (e.g., duty-cycle scheduling, self-stabilizing daemons, and contention managers). Unfortunately, wait-free dining is unsolvable in asynchronous systems. As such, we characterize sufficient conditions for solvability under partial synchrony by presenting a wait-free dining algorithm for ◊WX using a local refinement of the eventually perfect failure detector ◊P1.