A failure detector for mutual exclusion in unknown dynamic systems
Invited talk: Denis Jeanneau presented "A failure detector for mutual exclusion in unknown dynamic systems" in visio the 5/5/2020 at 11h00.
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 talk, 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.
Denis Jeanneau received a PhD degree from Sorbonne Université in 2018 after a thesis in the Delys team at LIP6. Since then he has been occupying an ATER position at IUT de Paris. His main research interest consists in studying dynamic distributed systems, and adapting existing distributed algorithms to these new systems. In particular, how the use of failure detectors to abstract system model properties might be extended to dynamic connectivity properties.