A General scheme for token and tree based distributed mutual exclusion algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

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

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1692.pdf (1002.34 Ko) Télécharger le fichier

Dates and versions

inria-00076927 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00076927 , version 1

Cite

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⟩
131 View
122 Download

Share

Gmail Facebook Twitter LinkedIn More