Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2013

Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant

Abstract

We propose in this paper a new algorithm that, when called by existing token ring-based algorithms of parallel and distributed applications, easily renders the token tolerant to losses in presence of node crashes. At most k consecutive node crashes are tolerated in the ring. Our algorithm scales very well since a node monitors the liveness of at most k other nodes and neither a global election algorithm nor broadcast primitives are used to regenerate a new token. It is thus very effective in terms of latency cost. Finally, a study of the probability of having at most k consecutive node crashes in the presence of f failures and a discussion of how to extend our algorithm to other logical topologies are also presented.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-8359.pdf (1021.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00859863 , version 1 (09-09-2013)

Identifiers

  • HAL Id : hal-00859863 , version 1

Cite

Luciana Arantes, Julien Sopena. Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant. [Research Report] RR-8359, INRIA. 2013, pp.23. ⟨hal-00859863⟩
251 View
1346 Download

Share

Gmail Facebook X LinkedIn More