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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Local and Global Properties in Networks of Processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)
Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. John Wiley & Sons, Chichester (2004)
Bodlaender, H.-L., Van Leeuwen, J.: Simulation of Large Networks on Smaller Networks. Information and Control 71, 143–180 (1986)
Bodlaender, H.-L.: The Classification of Coverings of Processor Networks. Journal of Parallel and Distributed Computing 6, 166–182 (1989)
Boldi, P., Vigna, S.: Computing Anonymously with Arbitrary Knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 181–188. ACM Press, New York (1999)
Boldi, P., Vigna, S.: An Effective Characterization of Computability in Anonymous Networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33–47. Springer, Heidelberg (2001)
Boldi, P., Vigna, S.: Fibrations of Graphs. Discrete Math. 243, 21–66 (2002)
Chalopin, J., Métivier, Y.: A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 212–223. Springer, Heidelberg (2005)
Godard, E., Métivier, Y.: A Characterization of Families of Graphs in Which Election Is Possible. In: Nielsen, M., Engberg, U. (eds.) ETAPS 2002 and FOSSACS 2002. LNCS, vol. 2303, pp. 159–171. Springer, Heidelberg (2002)
Godard, E., Métivier, Y., Tel, G.: Detection of the Termination of Distributed Algorithms. Submitted
Itai, A., Rodeh, M.: Symmetry Breaking in Distributive Networks. In: Proceedings of the 13th Symposium on Theory of Computing, pp. 150–158 (1981)
Mattern, F.: Algorithms for Distributed Termination Detection. Distributed Computing 2, 161–175 (1987)
Mazurkiewicz, A.: Distributed Enumeration. Inf. Processing Letters 61, 233–239 (1997)
Métivier, Y., Muscholl, A., Wacrenier, P.-A.: About the Local Detection of Termination of Local Computations in Graphs. In: Krizanc, D., Widmayer, P. (eds.) SIROCCO97 – 4th International Colloquium on Structural Information & Communication Complexity. Proceedings in Informatics, pp. 188–200. Carleton Scientific, Waterloo (1997)
Métivier, Y., Tel, G.: Termination Detection and Universal Graph Reconstruction. In: SIROCCO00 – 7th International Colloquium on Structural Information & Communication Complexity, pp. 237–251 (2000)
Szymanski, B., Shy, Y., Prywes, N.: Synchronized Distributed Termination. IEEE Transactions on Software Engineering 11(10), 1136–1140 (1985)
Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2000)
Yamashita, M., Kameda, T.: Computing on Anonymous Networks: Part i – Characterizing the Solvable Cases. IEEE Transactions on Parallel and Distributed Systems 7(1), 69–89 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J., Godard, E., Métivier, Y., Tel, G. (2007). About the Termination Detection in the Asynchronous Message Passing Model. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-69507-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69506-6
Online ISBN: 978-3-540-69507-3
eBook Packages: Computer ScienceComputer Science (R0)