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

Luciana Arantes 1 Julien Sopena 1
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
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.
Document type :
Reports
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/hal-00859863
Contributor : Julien Sopena <>
Submitted on : Monday, September 9, 2013 - 3:52:43 PM
Last modification on : Thursday, March 21, 2019 - 2:19:21 PM
Long-term archiving on : Thursday, April 6, 2017 - 4:48:19 PM

File

RR-8359.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00859863, version 1

Citation

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⟩

Share

Metrics

Record views

359

Files downloads

1034