HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Performance evaluation of a fair fault-tolerant mutual exclusion algorithm

Julien Sopena 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 presents an efficient and fair fault-tolerant token-based algorithm for achieving mutual exclusion. It is an extension of the Naimi-Trehel algorithm that uses a distributed queue of token requests and a dynamic tree. In case of failures, our algorithm tries to recover the requests' queue by gathering intact portions of the one which existed just before the failure. Thus, fairness of token requests is preserved despite failures. Furthermore, the use of broad- cast is minimized when rebuilding the dynamic tree. Experiment results with different fault injection scenar- ios show that our approach presents a fast failure recovery and low message broadcast overhead.
Document type :
Conference papers
Complete list of metadata

Contributor : Julien Sopena Connect in order to contact the contributor
Submitted on : Tuesday, October 16, 2007 - 4:51:31 PM
Last modification on : Tuesday, March 22, 2022 - 11:10:10 AM


  • HAL Id : inria-00179807, version 1


Julien Sopena, Luciana Arantes, Pierre Sens. Performance evaluation of a fair fault-tolerant mutual exclusion algorithm. The 25th IEEE Symposium on Reliable Distributed Systems (SRDS 2006), Oct 2006, Leeds, United Kingdom. pp.225-234. ⟨inria-00179807⟩



Record views