
Evènement pour le groupe Algorithmique Distribuée
Date  20150216 14:0015:00 
Titre  SelfStabilizing Leader Election in Polynomial Steps 
Résumé  We present a silent selfstabilizing 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. Its memory requirement is asymptotically optimal, i.e., Theta(log n) bits per processes. Its round complexity is of the same order of magnitude (i.e., Theta(n) rounds), as the best existing algorithm (proposed by Datta et al) designed with similar settings,i.e., it does not use global knowledge and is proven under the unfair daemon).
To the best of our knowledge, this is the first asynchronous selfstabilizing leader election algorithm for arbitrary identified networks that is proven to achieve a stabilization time polynomial in steps. By contrast, we show that the previous best existing algorithm designed with similar settings stabilizes in a non polynomial number of steps in the worst case.
This talk and Stephane's visit is supported by CPU. 
Lieu  178 
Orateur  Stéphane Devismes 
Url  Université Joseph Fourier, Grenoble I 
Aucun document lié à cet événement. RetourRetour à l'index
 