Performance evaluation of a fair fault-tolerant mutual exclusion algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Performance evaluation of a fair fault-tolerant mutual exclusion algorithm

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.
Not file

Dates and versions

inria-00179807 , version 1 (16-10-2007)

Identifiers

  • HAL Id : inria-00179807 , version 1

Cite

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⟩
83 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More