Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2018

Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions

Stéphane Devismes
Colette Johnen

Résumé

We propose a general scheme, called Algorithm STlC, to compute spanning-tree-like data structures on arbitrary networks. STlC is self-stabilizing and silent and, despite its generality, is 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 O(nmax) rounds, where nmax is the maximum number of processes in a connected component. We also exhibit polynomial upper bounds on its stabilization time in steps and process moves holding for large classes of instantiations of Algorithm STlC. We illustrate the versatility of our approach by proposing several such instantiations that efficiently solve classical problems such as leader election, as well as, unconstrained and shortest-path spanning tree constructions.
Fichier principal
Vignette du fichier
main.pdf (611.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01667863 , version 1 (19-12-2017)
hal-01667863 , version 2 (16-02-2018)
hal-01667863 , version 3 (11-05-2018)
hal-01667863 , version 4 (09-10-2018)

Identifiants

  • HAL Id : hal-01667863 , version 4

Citer

Stéphane Devismes, David Ilcinkas, Colette Johnen. Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions. [Research Report] VERIMAG/LaBRI. 2018. ⟨hal-01667863v4⟩
596 Consultations
164 Téléchargements

Partager

Gmail Facebook X LinkedIn More