Certification of an exact worst-case self-stabilization time

Altisen, Karine; Corbineau, Pierre; Devismes, Stéphane

doi:10.1016/j.tcs.2022.11.019

Cited by 1 publication

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It stabilizes to a legitimate configuration from which a unique token circulates in the ring. We use the potential function given in [5]. 2. coloring is a vertex coloring algorithm [7].…”

Section: Exploring Daemonsmentioning

confidence: 99%

“…This subgraph can be huge and also dense since from a given configuration we may have up to 2 n − 1 possible directed edges, where n is the number of nodes. Note that worst-case scenarios in moves are frequently central [6,5]: at each step, exactly one process moves. Therefore, and because it limits the number of possible steps from a configuration to at most n, we focus in the experiments on central schedulers -even if the methods presented in the article actually work for other unfair daemons.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Exploring Worst Cases of Self-stabilizing Algorithms Using Simulations

Jahier,

Altisen,

Devismes

2023

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Self-stabilization qualifies the ability of a distributed system to recover after transient failures. SASA is a simulator of self-stabilizing algorithms written in the atomic-state model, the most commonly used model in the selfstabilizing area. A simulator is, in particular, useful to study the time complexity of algorithms. For example, one can experimentally check whether existing theoretical bounds are correct or tight. Simulations are also useful to get insights when no bound is known.In this paper, we use SASA to investigate the worst cases of various well-known self-stabilization algorithms. We apply classical optimization methods (such as local search, branch and bound, Tabu list) on the two sources of non-determinism: the choice of initial configuration and the scheduling of process activations (daemon). We propose a methodology based on heuristics and an open-source tool to find tighter worst-case lower bounds.

show abstract

“…It stabilizes to a legitimate configuration from which a unique token circulates in the ring. We use the potential function given in [5]. 2. coloring is a vertex coloring algorithm [7].…”

Section: Exploring Daemonsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%