On the power of synchronization between two adjacent processes

Abstract : We study the power of local computations on labelled edges (which allow two adjacent vertices to synchronize and to modify their states simultaneaously in function of their previous states) through the classical election problem. We characterize the graphs for which this problem has a solution. As corollaries we characterize graphs which admit an election algorithm for two seminal models : Angluin's model and asynchronous systems where processes communicate with synchronous message passing (i.e., there is a synchronization between the process sending the message and the one receiving it).
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00527102
Contributor : Yves Métivier <>
Submitted on : Monday, October 18, 2010 - 10:38:31 AM
Last modification on : Friday, March 9, 2018 - 11:25:24 AM

Identifiers

  • HAL Id : hal-00527102, version 1

Collections

Citation

Jérémie Chalopin, Yves Métivier. On the power of synchronization between two adjacent processes. Distributed Computing, Springer Verlag, 2010, 23 (3), pp.177-196. ⟨hal-00527102⟩

Share

Metrics

Record views

123