LRI - Laboratoire de Recherche en Informatique, LIFL - Laboratoire d'Informatique Fondamentale de Lille, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
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.
Type de document :
Communication dans un congrès
Euro-Par 2005 - 11th European Conference on Parallel and Distributed Computing, Aug 2005, Lisboa, Portugal. Springer, 3648, pp.654-663, 2005, Lecture Notes in Computer Science. 〈10.1007/11549468_72〉
https://hal.inria.fr/inria-00179797
Contributeur : Julien Sopena
<>
Soumis le : mardi 16 octobre 2007 - 16:39:45
Dernière modification le : mardi 17 avril 2018 - 11:33:12
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. Springer, 3648, pp.654-663, 2005, Lecture Notes in Computer Science. 〈10.1007/11549468_72〉. 〈inria-00179797〉
