A Tighter Bound For The Self-stabilization Time In Herman's Algorithm

Elsevier Science Bv
Publication Type:
Journal Article
Information Processing Letters, 2013, 113 (13), pp. 486 - 488
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012005101OK.pdf121.95 kB
Adobe PDF
We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 4/27N(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).
Please use this identifier to cite or link to this item: