A General scheme for token and tree based distributed mutual exclusion algorithms

Jean-Michel Hélary 1 Achour Mostefaoui 1 Michel Raynal 1
1 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : In a distributed context, mutual exclusion algorithms can be divided into two families according to their underlying algorithmic principles: those which are permission-based and those which are token-based. Within the latter family a lot of algorithms use a rooted tree structure to move the requests and the unique token. This paper presents a very general information structure (and the associated generic algorithm) for token-and treebased mutual exclusion algorithms. This general structure does not only cover, as particular cases, several known algorithms but also allows to design new algorithms well suited to topology requirements.
Type de document :
[Research Report] RR-1692, INRIA. 1992
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:37:44
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : vendredi 13 mai 2011 - 22:05:13



  • HAL Id : inria-00076927, version 1


Jean-Michel Hélary, Achour Mostefaoui, Michel Raynal. A General scheme for token and tree based distributed mutual exclusion algorithms. [Research Report] RR-1692, INRIA. 1992. 〈inria-00076927〉



Consultations de la notice


Téléchargements de fichiers