Skip to Main content Skip to Navigation

A Timer-Free Fault Tolerant K -Mutual Exclusion Algorithm

Mathieu Bouillaguet 1, 2 Luciana Arantes 1, 2 Pierre Sens 1, 2 
2 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : This paper proposes a fault tolerant permission-based k-mutual exclusion algorithm which does not rely on timers, nor on failure detectors, neither does it require extra messages for detecting node failures. Fault tolerance is integrated in the algorithm itself and it is provided if the underlying system guarantees the Responsiveness Property (RP). Based on Raymond's algorithm, our algorithm exploits the request-reply messages exchanged by processes to get access to one of the k units of the shared resource in order to dynamically detect failures and adapt the algorithm to tolerate them.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Mathieu Bouillaguet Connect in order to contact the contributor
Submitted on : Friday, June 12, 2009 - 6:33:14 PM
Last modification on : Tuesday, March 22, 2022 - 11:10:10 AM
Long-term archiving on: : Monday, October 15, 2012 - 12:21:11 PM


Files produced by the author(s)


  • HAL Id : inria-00394918, version 1


Mathieu Bouillaguet, Luciana Arantes, Pierre Sens. A Timer-Free Fault Tolerant K -Mutual Exclusion Algorithm. [Research Report] 2009. ⟨inria-00394918⟩



Record views


Files downloads