A tighter bound for the self-stabilization time in Herman's algorithm
- Publication Type:
- Journal Article
- Information Processing Letters, 2013, 113 (13), pp. 486 - 488
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 427N2 (0.148N2), and an upper bound of 0.64N2 is presented in Kiefer et al. (2011) . In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V.
Please use this identifier to cite or link to this item: