Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant
type: Dataset
description: 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.
identifier: Report N°: RR-8359
issued: 2026-05-09T19:47:21.266869
language: en
modified: 2026-05-09T19:47:21.266874
contact point: Organization
  fn: CCSD
keyword: distributed-algorithm
keyword: fault-tolerance
keyword: infoeu-reposemanticsreport
keyword: infoinfo-ohcomputer-science-csother-csoh
keyword: reports
keyword: scalability
keyword: token-based
landing page: https://inria.hal.science/hal-00859863

Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant
type: Distribution
format: HTML
issued: 2026-05-09T19:47:21.270935
modified: 2026-05-09T19:47:21.192754
access URL: https://inria.hal.science/hal-00859863

test_moissonnage_selune
type: Agent