A O(log2n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

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

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.

Domains

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

Dates and versions

inria-00074630 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074630 , version 1

Cite

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⟩
135 View
95 Download

Share

Gmail Facebook X LinkedIn More