Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions - Archive ouverte HAL Access content directly
Journal Articles Algorithmica Year : 2022

Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions


We propose a general scheme to compute tree-based data structures on arbitrary networks. This scheme is self-stabilizing, silent, and despite its generality, also efficient. It is written in the locally shared memory model with composite atomicity assuming the distributed unfair daemon, the weakest scheduling assumption of the model. Its stabilization time is in at most $4n'$ rounds, where $n'$ is the maximum number of processes in any connected component of the network. We illustrate the versatility and efficiency of our approach by proposing several instantiations solving classical spanning tree problems such as DFS, BFS, shortest-path, or unconstrained spanning tree/forest constructions, as well as other fundamental problems like leader election or finding maximum-bottleneck-bandwidth paths. We also exhibit polynomial upper bounds on its stabilization time in steps and process moves, holding for a large class of instantiations. In several cases, the polynomial step and move complexities we obtain for those instantiations match the best known complexities of existing algorithms, despite the latter being dedicated to particular problems. Furthermore, a significant set of instantiations of our scheme requires only bounded memory space per process. This set includes, but is not limited to, DFS, BFS, and shortest-path spanning tree constructions.
Fichier principal
Vignette du fichier
algorithmica.pdf (651.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03547132 , version 1 (15-11-2022)



Stéphane Devismes, David Ilcinkas, Colette Johnen. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica, 2022, 84 (1), pp.85-123. ⟨10.1007/s00453-021-00878-9⟩. ⟨hal-03547132⟩
72 View
32 Download



Gmail Facebook X LinkedIn More