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) [4]. In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V
) Shlomi Dolev Abstract A randomized uniform self-stabilizing protocol that provides each (anonym...
In this article we survey algorithmic lower bound results that have been obtained in the field of ex...
The paper presents techniques to derive upper bounds for the mean time to recover from a single faul...
We study the expected self-stabilization time of Herman's algorithm. For N processors the lower boun...
Self-stabilization algorithms are very important in designing fault-tolerant distributed systems. In...
Herman's self-stabilization algorithm, introduced 25 years ago, is a well-studied synchronous random...
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ...
AbstractIn this article we investigate the expected time for Herman's probabilistic self-stabilizing...
In this paper, we address the unison problem. We consider the self-stabilizing algorithm proposed by...
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ...
Herman's Ring [Inform. Process. Lett. 35 (1990) 63; http://www.cs.uiowa.edu/ftp/selfstab/H90.ps.gz] ...
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time st...
Abstract. Herman’s self-stabilisation algorithm provides a simple randomised solution to the problem...
International audienceWe propose a new metric for effectively and accurately evaluating the performa...
AbstractThe maximum weight matching problem is a fundamental problem in graph theory with a variety ...
) Shlomi Dolev Abstract A randomized uniform self-stabilizing protocol that provides each (anonym...
In this article we survey algorithmic lower bound results that have been obtained in the field of ex...
The paper presents techniques to derive upper bounds for the mean time to recover from a single faul...
We study the expected self-stabilization time of Herman's algorithm. For N processors the lower boun...
Self-stabilization algorithms are very important in designing fault-tolerant distributed systems. In...
Herman's self-stabilization algorithm, introduced 25 years ago, is a well-studied synchronous random...
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ...
AbstractIn this article we investigate the expected time for Herman's probabilistic self-stabilizing...
In this paper, we address the unison problem. We consider the self-stabilizing algorithm proposed by...
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ...
Herman's Ring [Inform. Process. Lett. 35 (1990) 63; http://www.cs.uiowa.edu/ftp/selfstab/H90.ps.gz] ...
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time st...
Abstract. Herman’s self-stabilisation algorithm provides a simple randomised solution to the problem...
International audienceWe propose a new metric for effectively and accurately evaluating the performa...
AbstractThe maximum weight matching problem is a fundamental problem in graph theory with a variety ...
) Shlomi Dolev Abstract A randomized uniform self-stabilizing protocol that provides each (anonym...
In this article we survey algorithmic lower bound results that have been obtained in the field of ex...
The paper presents techniques to derive upper bounds for the mean time to recover from a single faul...
DOI
Add to ORKG