Election in Partially Anonymous Networks with Arbitrary Knowledge in Message Passing Systems

Jérémie Chalopin (1) , Emmanuel Godard (1) , Yves Métivier (2)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

This paper attempts to find an answer to an open question of Angluin in her seminal paper (Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82-93 (1980)) about the election problem for families of graphs (Section 4, page 87). More precisely, we characterize families of (labelled) graphs which admit an election algorithm in the message passing model by using the notion of quasi-coverings which captures ''the existence of large enough area of one graph that looks locally like another graph''.

Mots clés: Election algorithm for families of graphs; covering; quasi-covering

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Jérémie Chalopin, Emmanuel Godard, Yves Métivier. Election in Partially Anonymous Networks with Arbitrary Knowledge in Message Passing Systems. Distributed Computing, 2012, 25 (4), pp.297-311. ⟨hal-00695944⟩