About the Termination Detection in the Asynchronous Message Passing Model

Authors:
Jérémie Chalopin;Emmanuel Godard;Yves Métivier;Gerard Tel
Affiliations:
LaBRI UMR 5800 Université Bordeaux 1, ENSEIRB, 351 cours de la Libération 33405 Talence, France;LIF UMR 6166 Université de Provence 39 rue Joliot-Curie 13453 Marseille, France;LaBRI UMR 5800 Université Bordeaux 1, ENSEIRB, 351 cours de la Libération 33405 Talence, France;Department of Computer Science University of Utrecht, P.O. box 80.089, 3508 TB Utrecht, The Netherlands
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Citing 13
Cited 4

Synchronized Distributed Termination

IEEE Transactions on Software Engineering
Simulation of large networks on smaller networks

Information and Control
The classification of coverings of processor networks

Journal of Parallel and Distributed Computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases

IEEE Transactions on Parallel and Distributed Systems
Distributed enumeration

Information Processing Letters
Computing anonymously with arbitrary knowledge

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fibrations of graphs

Discrete Mathematics
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms
An Effective Characterization of Computability in Anonymous Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Characterization of Families of Graphs in Which Election Is Possible

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
A bridge between the asynchronous message passing model and local computations in graphs

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Rendezvous of mobile agents without agreement on local orientation

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz

Quantified Score

Hi-index	0.00

Visualization

Abstract

Starting with the works by Angluin [1] and Itai and Rodeh [11], many papers have discussed the question what functions can be computed by distributed algorithms in networks where knowledge about the network topology is limited.