Algorithms for mutual exclusion
Algorithms for mutual exclusion
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing
Resource allocation with immunity to limited process failure
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Anti-Ω: the weakest failure detector for set agreement
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Every problem has a weakest failure detector
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Extracting quorum failure detectors
Proceedings of the 28th ACM symposium on Principles of distributed computing
The weakest failure detector for solving k-set agreement
Proceedings of the 28th ACM symposium on Principles of distributed computing
The weakest failure detectors to boost obstruction-freedom
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Asynchronous failure detectors
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Research over the past two decades has identified the weakest failure detectors for several important problems in fault-tolerant distributed computing. A recent work has shown that, for a certain definition of the term "problem," every problem that is solvable using failure detectors has a weakest failure detector. In sharp contrast to these results, we prove that a fundamental problem in concurrent computing--FCFS Mutual Exclusion--is solvable using failure detectors, but has no weakest failure detector in the shared memory model. To the best of our knowledge, this is the first problem that is proved not to have a weakest failure detector. We also show that, if the FCFS requirement is dropped, the mutual exclusion problem has a weakest failure detector. In fact, we present the weakest failure detector for the more general problem of starvation-free k-exclusion, for any k.