4461 articles – 13151 references  [version française]
HAL: hal-00695582, version 1

Detailed view  Export this paper
19th International Colloquium on Structural Information and Communication Complexity, Iceland (2012)
On snapshots and stable properties detection in anonymous fully distributed systems (Extended abstract)
Jérémie Chalopin 1, Yves Métivier 2, Thomas Morsellino 2
(2012-05-09)

Most known snapshot algorithms assume that the vertices of the network have unique identifiers and/or that there is exactly one initiator. This paper concerns snapshot computation in an anonymous network and more generally what stable properties of a distributed system can be computed anonymously with local snapshots with multiple initiators when knowing an upper bound on the diameter of the network.
1:  Laboratoire d'informatique Fondamentale de Marseille (LIF)
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I
2:  Laboratoire Bordelais de Recherche en Informatique (LaBRI)
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II
Computer Science/Distributed, Parallel, and Cluster Computing
Snapshot – Stable properties – Anonymous fully distributed system