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

Abstract : 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 define a new failure detector TΣ^lr which is equivalent to (T +Σ^l) in known static systems, and prove that TΣ^lr is the weakest failure detector to solve mutual exclusion in unknown dynamic systems with partial memory losses. We consider that crashed processes may recover.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01661127
Contributor : Denis Jeanneau <>
Submitted on : Wednesday, October 31, 2018 - 4:02:07 PM
Last modification on : Wednesday, September 11, 2019 - 10:10:09 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01661127, version 3

Citation

Etienne Mauffret, Denis 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. 2018. ⟨hal-01661127v3⟩

Share

Metrics

Record views

234

Files downloads

241