 |
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
 |
|
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
|
| HAL: hal-00308125, version 1 |
| Detailed view |  Export this paper |
 |
| Fundamenta Informaticae 80, 1-3 (2007) 221-246 |
|
|
|
|
| An efficient message passing algorithm based on Mazurkiewicz s algorithm |
|
|
| Jérémie Chalopin 1Yves Métivier 2 |
|
|
| (2007) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 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 |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Other Computer Science/Distributed, Parallel, and Cluster Computing |
| hal-00308125, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00308125 | |
| oai:hal.archives-ouvertes.fr:hal-00308125 | |
| From: Yves Métivier | |
| Submitted on: Tuesday, 29 July 2008 17:12:15 | |
| Updated on: Friday, 24 October 2008 15:30:22 | |
