Skip to Main content Skip to Navigation
Conference papers

Local terminations and distributed computability in anonymous networks

Abstract : We investigate the computability of distributed tasks in reliable anonymous networks with arbitrary knowledge. More precisely, we consider tasks computable with local termination, i.e., a node knows when to stop to participate in a distributed algorithm, even though the algorithm is not necessarily terminated elsewhere. We also study weak local termination, that is when a node knows its final value but continues to execute the distributed algorithm, usually in order to provide information to other nodes. We give the first characterization of distributed tasks that can be computed with weak local termination and we present a new characterization of tasks computed with local termination. For both terminations, we also characterize tasks computable by polynomial algorithms.
Complete list of metadata
Contributor : Yves Métivier Connect in order to contact the contributor
Submitted on : Tuesday, October 21, 2008 - 4:18:40 PM
Last modification on : Friday, March 9, 2018 - 11:24:57 AM


  • HAL Id : hal-00332759, version 1



Jérémie Chalopin, Emmanuel Godard, Yves Métivier. Local terminations and distributed computability in anonymous networks. International symposium on distributed computing (DISC), Sep 2008, Arcachon, France. pp.47-62. ⟨hal-00332759⟩



Record views