Skip to Main content Skip to Navigation
Conference papers

A fault-tolerant token-based mutual exclusion algorithm using a dynamic tree

Julien Sopena 1 Luciana Arantes 1 Marin Bertier 2, 3 Pierre Sens 1
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
2 PARIS - Programming distributed parallel systems for large scale numerical simulation
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, ENS Cachan - École normale supérieure - Cachan, Inria Rennes – Bretagne Atlantique
3 GRAND-LARGE - Global parallel and distributed computing
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LIFL - Laboratoire d'Informatique Fondamentale de Lille, LRI - Laboratoire de Recherche en Informatique
Abstract : This article presents a fault tolerant extension for the Naimi-Trehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in which token requests would have been satisfied had the failure not occurred.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00179797
Contributor : Julien Sopena Connect in order to contact the contributor
Submitted on : Tuesday, October 16, 2007 - 4:39:45 PM
Last modification on : Thursday, July 8, 2021 - 3:49:25 AM

Links full text

Identifiers

Citation

Julien Sopena, Luciana Arantes, Marin Bertier, Pierre Sens. A fault-tolerant token-based mutual exclusion algorithm using a dynamic tree. Euro-Par 2005 - 11th European Conference on Parallel and Distributed Computing, Aug 2005, Lisboa, Portugal. pp.654-663, ⟨10.1007/11549468_72⟩. ⟨inria-00179797⟩

Share

Metrics

Record views

971