A O(log2n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure

Jean-Michel Hélary 1 Achour Mostefaoui 1
1 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree structure is presented. The rooted tree introduced, named "open-cube", has noteworthy stability and locality properties, allowing the proposed algorithm to achieve good performances and high tolerance to node failures : the worst case message complexity per request is, in the absence of node failures, log2N+1 where N is the number of nodes, whereas 0(log2N) extra messages in the average are necessary to tolerate each node failure. This algorithm is a particular instance of a general scheme for token and tree-based distributed mutual exclusion algorithms, previously presented in part by the authors, consequently, its safety and liveness properties are inherited from the general one, however, the present paper is self-contained.
Type de document :
[Research Report] RR-2041, INRIA. 1993
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:57:07
Dernière modification le : mercredi 11 avril 2018 - 02:00:15
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:21:12



  • HAL Id : inria-00074630, version 1


Jean-Michel Hélary, Achour Mostefaoui. A O(log2n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure. [Research Report] RR-2041, INRIA. 1993. 〈inria-00074630〉



Consultations de la notice


Téléchargements de fichiers