An efficient message passing algorithm based on Mazurkiewicz s algorithm

Abstract : We study the election and the naming problems in the asynchronous message passing model. We present a necessary condition based on Angluin's lifting lemma that must be satisfied by any network that admits a naming (or an election) algorithm. We then show that this necessary condition is also sufficient: we present an election and naming algorithm based on Mazurkiewicz's algo\-rithm. The algorithm we obtained is totally asynchronous and it needs a polynomial number of messages of polynomial size, whereas previous election algorithms in this model are pseudo-synchronous and use messages of exponential size.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00308125
Contributor : Yves Métivier <>
Submitted on : Tuesday, July 29, 2008 - 5:12:15 PM
Last modification on : Friday, March 9, 2018 - 11:24:53 AM

Identifiers

  • HAL Id : hal-00308125, version 1

Collections

Citation

Jérémie Chalopin, Yves Métivier. An efficient message passing algorithm based on Mazurkiewicz s algorithm. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2007, 80 (1-3), pp.221-246. ⟨hal-00308125⟩

Share

Metrics

Record views

185