The Weakest Failure Detector to Solve the Mutual Exclusion Problem in an Unknown Dynamic Environment.

Etienne Mauffret (1) , Élise Jeanneau (2) , Luciana Arantes (2) , Pierre Sens (2)

1 LISTIC - Laboratoire d'Informatique, Systèmes, Traitement de l'Information et de la Connaissance
2 Regal - Large-Scale Distributed Systems and Applications

Mutual exclusion is one of the fundamental problems in distributed computing but existing mutual exclusion algorithms are unadapted to the dynamics and lack of membership knowledge of current distributed systems (e.g., mobile ad-hoc networks, peer-to-peer systems, etc.). Additionally, in order to circumvent the impossibility of solving mutual exclusion in asynchronous message passing systems where processes can crash, some solutions include the use of (T +Σ^l), which is the weakest failure detector to solve mutual exclusion in known static distributed systems. In this paper, we prove that (T +Σ^l) is also the weakest failure detector to solve mutual exclusion in unknown dynamic systems with partial memory losses. We consider that crashed processes may recover.

Mots clés: and phrases Distributed algorithms; dynamic networks; mutual exclusion; failure

Domaines: Informatique [cs]; Calcul parallèle, distribué et partagé [cs.DC]

Etienne Mauffret, Élise Jeanneau, Luciana Arantes, Pierre Sens. The Weakest Failure Detector to Solve the Mutual Exclusion Problem in an Unknown Dynamic Environment.. [Technical Report] LISTIC; Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606. 2017. ⟨hal-01661127v2⟩