HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 11:37:44 AM
Last modification on : Friday, February 4, 2022 - 3:22:08 AM
Long-term archiving on: : Friday, May 13, 2011 - 10:05:13 PM


  • 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⟩



Record views


Files downloads