Exploring Worst Cases of Self-stabilizing Algorithms using Simulations - CNRS - Centre national de la recherche scientifique Access content directly
Conference Papers Year : 2023

Exploring Worst Cases of Self-stabilizing Algorithms using Simulations

Abstract

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 one in the self-stabilizing 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 (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.
Fichier principal
Vignette du fichier
main.pdf (426.99 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Comment C'est sans doute parce que certaines fontes n'étaient pas embarquées je crois (j'espere).

Dates and versions

hal-04172383 , version 1 (23-08-2023)

Identifiers

Cite

Erwan Jahier, Stéphane Devismes, Karine Altisen. Exploring Worst Cases of Self-stabilizing Algorithms using Simulations. 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Shlomi Dolev, Baruch Schieber, Oct 2023, New Jersey, United States. ⟨10.1007/978-3-031-44274-2⟩. ⟨hal-04172383⟩
67 View
48 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More