Self-Stabilizing Leader Election in Polynomial Steps - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2014

Self-Stabilizing Leader Election in Polynomial Steps

Karine Altisen
  • Fonction : Auteur
  • PersonId : 832502
Stéphane Devismes
Anaïs Durand

Résumé

In this paper, we propose a silent self-stabilizing leader election algorithm for bidirectional connected identified networks of arbitrary topology. This algorithm is written in the locally shared memory model. It assumes the distributed unfair daemon, the most general scheduling hypothesis of the model. Our algorithm requires no global knowledge on the network (such as an upper bound on the diameter or the number of processes, for example). We show that its stabilization time is in $\Theta(n^3)$ steps in the worst case, where $n$ is the number of processes. To the best of our knowledge, this is the first self-stabilizing leader election algorithm for arbitrary identified networks that is proved to achieve a stabilization time polynomial in steps. Its memory requirement is asymptotically optimal, {\em i.e.}, $\Theta(\log n)$ bits per processes. Its round complexity is of the same order of magnitude --- {\em i.e.}, $\Theta(n)$ rounds --- as the best existing algorithms designed with similar settings ({\em i.e.}, those that do not use global knowledge and that are proved under the unfair daemon).
Fichier principal
Vignette du fichier
report.pdf (422.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00980798 , version 1 (18-04-2014)
hal-00980798 , version 2 (22-04-2014)
hal-00980798 , version 3 (02-05-2014)
hal-00980798 , version 4 (12-02-2015)

Identifiants

  • HAL Id : hal-00980798 , version 1

Citer

Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit. Self-Stabilizing Leader Election in Polynomial Steps. 2014. ⟨hal-00980798v1⟩
764 Consultations
377 Téléchargements

Partager

Gmail Facebook X LinkedIn More