Presentation and study of some distributed algorithm problems
type: Dataset
description: In this thesis, we first present a study of several problems in the field of distributed algorithms. We provide a formal model that relies on anonymous networks. In this model, we characterize graphs in which it is possible to solve enumeration and leader election problems. This characterization is based on graph homomorphism. We introduce two algorithms with polynomial complexities that improve existing works with exponential complexities. On the other hand, we study the snapshot problem and we introduce the notion of weak snapshot. We show that there exist solutions for this problem in the context of anonymous networks. We present several results about distributed snapshots that deal with checkpoint and rollback recovery, termination detection or the cartography computation of a network. In a practical aspect, we present the conception, the development process and the implementation of these distributed snapshot algorithms within the simulation and visualization software ViSiDiA.
landing page: https://theses.hal.science/tel-00991004
identifier: NNT: 4586
keyword: algorithme-distribue
keyword: algorithmes
keyword: anonymous-network
keyword: debogage
keyword: debugging
keyword: distributed-algorithm
keyword: election
keyword: enumeration
keyword: etat-global
keyword: graph
keyword: graphe
keyword: infoeu-reposemanticsdoctoralthesis
keyword: infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc
keyword: leader-election
keyword: modelisation
keyword: modelization
keyword: propriete-stable
keyword: reseau-anonyme
keyword: reseaux-anonymes
keyword: snapshot
keyword: stable-property
keyword: theorie-des-graphes
keyword: theses
keyword: visualisation
keyword: visualization
issued: 2026-05-05T11:17:06.777310
modified: 2026-05-05T11:17:06.777314
language: fr
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Presentation and study of some distributed algorithm problems
type: Distribution
format: HTML
access URL: https://theses.hal.science/tel-00991004
issued: 2026-05-05T11:17:06.779308
modified: 2026-05-05T11:17:06.751175