Performance evaluation of a fair fault-tolerant mutual exclusion algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Performance evaluation of a fair fault-tolerant mutual exclusion algorithm

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00179807 , version 1

Citer

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⟩
92 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More