A tighter bound for the self-stabilization time in Herman's algorithm
Posted: February 7, 2014
| Title | A tighter bound for the self-stabilization time in Herman's algorithm |
| Publication Type | Journal Article |
| Year of Publication | 2013 |
| Authors | Feng Y., Zhang L. |
| Journal | Information processing letters |
| Volume | 113 |
| Pagination | 486–488 |
| Date Published | July |
| ISSN | 0020-0190 |
| 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. |
| DOI | 10.1016/j.ipl.2013.04.006 |
