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) . In this paper we give a tighter upper bound 0.521N^2.
- EC Grant Agreement nr.: FP7/2007-2013
- EC Grant Agreement nr.: FP7/318003