A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Algorithms for scalable synchronization on shared-memory multiprocessors
ACM Transactions on Computer Systems (TOCS)
Improving fast mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The communication requirements of mutual exclusion
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
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
f-arrays: implementation and applications
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
A Time Complexity Bound for Adaptive Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Adaptive and efficient mutual exclusion
Distributed Computing
An improved lower bound for the time complexity of mutual exclusion
Distributed Computing - Special issue: Selected papers from PODC '01
Long lived adaptive splitter and applications
Distributed Computing
Adaptive solutions to the mutual exclusion problem
Distributed Computing
An Ω (n log n) lower bound on the cost of mutual exclusion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Tight RMR lower bounds for mutual exclusion and other problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Adaptive mutual exclusion with local spinning
Distributed Computing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The failure detector abstraction
ACM Computing Surveys (CSUR)
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Relations linking failure detectors associated with k-set agreement in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
In the set-agreement problem, nprocesses seek to agree on at most n茂戮驴 1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, called the Lonelinessdetector and denoted $\mathcal{L}$, outputs one of two values, "true"or "false"such that: (1) there is at least one process where $\mathcal{L}$ outputs always "false", and (2) if only one process is correct, $\mathcal{L}$ eventually outputs "true"at this process.