Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Self-stabilization
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Fast allocation of nearby resources in a distributed system
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Dining Philosophers with Crash Locality 1
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
Eventually k-Bounded Wait-Free Distributed Daemons
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Wait-free dining under eventual weak exclusion
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Asynchronous failure detectors
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under eventual weak exclusion in message-passing systems with crash faults. Wait-free dining ensures that every correct hungry process eventually eats. Eventual weak exclusion permits finitely many scheduling mistakes, but eventually no live neighbors eat simultaneously; this exclusion criterion models scenarios where scheduling mistakes are recoverable or only affect performance. Previous work showed that the eventually perfect failure detector (◊P) is sufficient to solve wait-free dining under eventual weak exclusion; we prove that ◊P is also necessary, and thus ◊P is the weakest oracle to solve this problem. Our reduction also establishes that any such dining solution can be made eventually fair. Finally, the reduction itself may be of more general interest; when applied to wait-free perpetual weak exclusion, our reduction produces an alternative proof that the more powerful trusting oracle (T) is necessary (but not sufficient) to solve the problem of Fault-Tolerant Mutual Exclusion (FTME).