About the termination detection in the asynchronous message passing model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4362 LNCS, Issue , 2007, Pages 200-211

  Chalopin, Jérémie ^a   Godard, Emmanuel ^b   Métivier, Yves ^a   Tel, Gerard ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

^c UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 36649007968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69507-3_16     Document Type: Conference Paper

References (18)

1. Angluin, D.: Local and Global Properties in Networks of Processors. In Proceedings of the 12th Symposium on Theory of Computing (1980) 82-93
2. Attiya, H. and Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. John Wiley & Sons (2004)
3. Bodlaender, H.-L. and Van Leeuwen, J.: Simulation of Large Networks on Smaller Networks. Information and Control 71 (1986) 143-180
4. Bodlaender, H.-L.: The Classification of Coverings of Processor Networks. Journal of Parallel and Distributed Computing 6 (1989) 166-182
5. Boldi, P. and Vigna, S.: Computing Anonymously with Arbitrary Knowledge. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, ACM Press (1999) 181-188
6. Boldi, P. and Vigna, S.: An Effective Characterization of Computability in Anonymous Networks. In Jennifer L. Welch (eds), Distributed Computing. 15th International Conference, DISC 2001, Springer-Verlag, Lecture Notes in Computer Science 2180 (2001) 33-47
7. Boldi, P. and Vigna, S.: Fibrations of Graphs. Discrete Math. 243 (2002) 21-66
8. Chalopin, J. and Métivier, Y.: A Bridge between the Asynchronous Message Passing Model and Local Computations in Graphs (extended abstract). In Proc. of Mathematical Foundations of Computer Science, MFCS'05, LNCS 3618 (2005) 212-223
9. Godard, E. and Métivier, Y.: A Characterization of Families of Graphs in which Election Is Possible (ext. abstract). In M. Nielsen and U. Engberg (eds), Proc. of Foundations of Software Science and Computation Structures, FOSSACS'02, Springer-Verlag, LNCS 2303 (2002) 159-171
10. Godard, E., Métivier, Y., and Tel, G.: Detection of the Termination of Distributed Algorithms. Submitted.
11. Itai, A. and Rodeh, M.: Symmetry Breaking in Distributive Networks. In Proceedings of the 13th Symposium on Theory of Computing (1981) 150-158
12. Mattern, F.: Algorithms for Distributed Termination Detection. Distributed Computing 2 (1987) 161-175
13. Mazurkiewicz, A.: Distributed Enumeration. Inf. Processing Letters 61 (1997) 233-239
14. Métivier, Y., Muscholl, A., and Wacrenier, P.-A.: About the Local Detection of Termination of Local Computations in Graphs. In D. Krizanc and P. Widmayer (eds), SIROCC097 - 4th International Colloquium on Structural Information & Communication Complexity, Proceedings in Informatics, Carleton Scientific (1997) 188-200
15. Métivier, Y. and Tel, G.: Termination Detection and Universal Graph Reconstruction. In SIROCCO00 - 7th International Colloquium on Structural Information & Communication Complexity (2000) 237-251
16. Szymanski, B., Shy, Y., and Prywes, N.: Synchronized Distributed Termination. IEEE Transactions on Software Engineering, SE-11 10 (1985) 1136-1140
17. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (2000)
18. Yamashita, M. and Kameda, T.: Computing on Anonymous Networks: Part i -Characterizing the Solvable Cases. IEEE Transactions on Parallel and Distributed Systems 7 1 (1996) 69-89