About the Termination Detection in the Asynchronous Message Passing Model

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.

[1]  Sebastiano Vigna,et al.  An Effective Characterization of Computability in Anonymous Networks , 2001, DISC.

[2]  Sebastiano Vigna,et al.  Computing anonymously with arbitrary knowledge , 1999, PODC '99.

[3]  Friedemann Mattern,et al.  Algorithms for distributed termination detection , 1987, Distributed Computing.

[4]  Hans L. Bodlaender,et al.  The Classification of Coverings of Processor Networks , 1989, J. Parallel Distributed Comput..

[5]  Alon Itai,et al.  Symmetry breaking in distributive networks , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[6]  Michel Rigo,et al.  Abstract numeration systems and tilings , 2005 .

[7]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[8]  Yves Métivier,et al.  A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs , 2005, MFCS.

[9]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[10]  Yves Métivier,et al.  Termination detection and universal graph reconstruction , 2000, SIROCCO.

[11]  Sebastiano Vigna,et al.  Fibrations of graphs , 2002, Discret. Math..

[12]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[13]  Jan van Leeuwen,et al.  Simulation of Large Networks on Smaller Networks , 1985, Inf. Control..

[14]  Boleslaw K. Szymanski,et al.  Synchronized Distributed Termination , 1985, IEEE Transactions on Software Engineering.

[15]  Ran Libeskind-Hadas,et al.  On Multicast Algorithms for Heterogeneous Networks of Workstations , 1989, J. Parallel Distributed Comput..

[16]  Oscar H. IBARm.  Information and Control , 1957, Nature.

[17]  Masafumi Yamashita,et al.  Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[18]  Sebastiano Vigna,et al.  Symmetry Breaking in Anonymous Networks: Characterizations , 1996, ISTCS.

[19]  Jan van Leeuwen,et al.  Simulation of Large Networks on Smaller Networks , 1986, Inf. Control..

[20]  Antoni W. Mazurkiewicz.  Distributed Enumeration , 1997, Inf. Process. Lett..

[21]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[22]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[23]  Yves Métivier,et al.  A Characterization of Families of Graphs in Which Election Is Possible , 2002, FoSSaCS.

[24]  Anca Muscholl,et al.  About the local detection of termination of local computations in graphs , 1997, SIROCCO.