Mutual exclusion in asynchronous systems with failure detectors

Authors:
Carole Delporte-Gallet;Hugues Fauconnier;Rachid Guerraoui;Petr Kouznetsov
Affiliations:
Laboratoire d'Informatique Algorithmique, Fondements et Applications, University of Paris VII, France;Laboratoire d'Informatique Algorithmique, Fondements et Applications, University of Paris VII, France;School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland;School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 15
Cited 16

An efficient and fault-tolerant solution for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Asynchronous group mutual exclusion (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A Fair Distributed Mutual Exclusion Algorithm

IEEE Transactions on Parallel and Distributed Systems
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
A note on group mutual exclusion

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Simple Local-Spin Group Mutual Exclusion Algorithm

IEEE Transactions on Parallel and Distributed Systems
Distributed Algorithms

Distributed Algorithms
Analysis of Timing-Based Mutual Exclusion with Random Times

SIAM Journal on Computing
A simple group mutual l-exclusion algorithm

Information Processing Letters
Backoff Protocols for Distributed Mutual Exclusion and Ordering

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems

Type-based publish/subscribe: Concepts and experiences

ACM Transactions on Programming Languages and Systems (TOPLAS)
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

Journal of Parallel and Distributed Computing
On the weakest failure detector ever

Proceedings of the twenty-sixth annual 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
On Replication of Software Transactional Memories

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
With Finite Memory Consensus Is Easier Than Reliable Broadcast

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Extracting quorum failure detectors

Proceedings of the 28th ACM symposium on Principles of distributed computing
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
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
Wait-free dining under eventual weak exclusion

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
On the existence of weakest failure detectors for mutual exclusion and k-exclusion

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Crash-quiescent failure detection

DISC'09 Proceedings of the 23rd international conference on Distributed computing
The failure detector abstraction

ACM Computing Surveys (CSUR)
Failure detectors encapsulate fairness

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Asynchronous failure detectors

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Quorum-based mutual exclusion in asynchronous distributed systems with unreliable failure detectors

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem, given a majority of correct processes. This failure detector, which we call the trusting failure detector, and which we denote by T, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector @?P. The paper shows that a majority of correct processes is necessary to solve the problem with T. Moreover, T is also the weakest failure detector to solve the fault-tolerant group mutual exclusion problem, given a majority of correct processes.