Local Terminations and Distributed Computability in Anonymous Networks

Authors:
Jérémie Chalopin;Emmanuel Godard;Yves Métivier
Affiliations:
Laboratoire d'Informatique Fondamentale de Marseille, CNRS & Aix-Marseille Universitééé,;Laboratoire d'Informatique Fondamentale de Marseille, CNRS & Aix-Marseille Universitééé,;LaBRI, Université de Bordeaux,
Venue:
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Year:
2008

Citing 19
Cited 1

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Indulgent algorithms (preliminary version)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the cost of fault-tolerant consensus when there are no faults: preliminary version

ACM SIGACT News
Distributed Algorithms

Distributed Algorithms
The inherent price of indulgence

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Deconstructing paxos

ACM SIGACT News
The Information Structure of Indulgent Consensus

IEEE Transactions on Computers
How Fast Can Eventual Synchrony Lead to Consensus?

DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
The inherent price of indulgence

Distributed Computing - Special issue: PODC 02
Timeliness, failure-detectors, and consensus performance

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
How to Choose a Timing Model?

DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks

Decidability classes for mobile agents computing

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

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.