A tighter bound for the self-stabilization time in Herman's algorithm

Authors:
Yuan Feng;Lijun Zhang
Affiliations:
University of Technology Sydney, Australia;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China and Technical University of Denmark, DTU Compute, Denmark
Venue:
Information Processing Letters
Year:
2013

Citing 7
Cited 0

Probabilistic self-stabilization

Information Processing Letters
Coupling and self-stabilization

Distributed Computing - Special issue: DISC 04
On the expected time for Herman's probabilistic self-stabilizing algorithm

Theoretical Computer Science
An elementary proof that Herman's Ring is Θ(N2)

Information Processing Letters
On stabilization in Herman's algorithm

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Probabilistic verification of Herman’s self-stabilisation algorithm

Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan
Three tokens in Herman’s algorithm

Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the expected self-stabilization time of Herman@?s algorithm. For N processors the lower bound is 427N^2 (0.148N^2), and an upper bound of 0.64N^2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N^2.