Silent self-stabilizing BFS tree algorithms revisited - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Parallel and Distributed Computing Année : 2016

Silent self-stabilizing BFS tree algorithms revisited

Stéphane Devismes

Résumé

In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev etźal. algorithm and the Huang and Chen's algorithm. More precisely, we propose in the composite atomicity model three straightforward adaptations inspired from those algorithms. We then present a deep study of these three algorithms. Our results are related to both correctness (convergence and closure, assuming a distributed unfair daemon) and complexity (analysis of the stabilization time in terms of rounds and steps). We show that the bounded-memory version of the Dolev et al's BFS is round-optimal.We show that the stabilization time of the Huang and Chen's BFS is Omega(n) rounds.We show that these two algorithms have exponential stabilization times in steps.
Fichier non déposé

Dates et versions

hal-01411862 , version 1 (07-12-2016)

Identifiants

Citer

Stéphane Devismes, Colette Johnen. Silent self-stabilizing BFS tree algorithms revisited. Journal of Parallel and Distributed Computing, 2016, 97 (C), pp.11-23. ⟨10.1016/j.jpdc.2016.06.003⟩. ⟨hal-01411862⟩
65 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More