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.
Partially supported by grant No ANR-06-SETI-015-03 awarded by A.N.R.
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: Proc. of STOC 1980, pp. 82–93 (1980)
Attiya, H., Snir, M., Warmuth, M.: Computing on an anonymous ring. J. ACM 35(4), 845–875 (1988)
Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. John Wiley and Sons, Chichester (2004)
Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: characterizations. In: Proc. of ISTCS 1996, pp. 16–26. IEEE Press, Los Alamitos (1996)
Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. of PODC 1999, 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 Mathematics 243(1-3), 21–66 (2002)
Boldi, P., Vigna, S.: Universal dynamic synchronous self-stabilization. Distributed Computing 15(3), 137–153 (2002)
Chalopin, J., Godard, E., Métivier, Y., Tel, G.: 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. LNCS, vol. 4362, pp. 200–211. Springer, Heidelberg (2007)
Chalopin, J.: Algorithmique distribuée, calculs locaux et homomorphismes de graphes. PhD thesis, Université Bordeaux 1 (2006)
Chalopin, J., Métivier, Y.: An efficient message passing election algorithm based on Mazurkiewicz’s algorithm. Fundamenta Informaticae 80(1–3), 221–246 (2007)
Dobrev, S., Pelc, A.: Leader election in rings with nonunique labels. Fundamenta Informaticae 59(4), 333–347 (2004)
Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computation. Information Processing Letters 11(1), 1–4 (1980)
Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F., Santoro, N.: Sorting and election in anonymous asynchronous rings. J. Parallel Distrib. Comput. 64(2), 254–265 (2004)
Godard, E., Métivier, Y., Tel, G.: Termination detection of distributed tasks. Technical Report 1418–06, LaBRI (2006)
Mattern, F.: Algorithms for distributed termination detection. Distributed computing 2(3), 161–175 (1987)
Mazurkiewicz, A.: Distributed enumeration. Information Processing Letters 61(5), 233–239 (1997)
Mavronicolas, M., Michael, L., Spirakis, P.: Computing on a partially eponymous ring. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 380–394. Springer, Heidelberg (2006)
Métivier, Y., Muscholl, A., Wacrenier, P.-A.: About the local detection of termination of local computations in graphs. In: Proc. of SIROCCO 1997, pp. 188–200. Carleton Scientific (1997)
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 functions on asynchronous anonymous networks. Math. Systems Theory 29(4), 331–356 (1996)
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
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J., Godard, E., Métivier, Y. (2008). Local Terminations and Distributed Computability in Anonymous Networks. In: Taubenfeld, G. (eds) Distributed Computing. DISC 2008. Lecture Notes in Computer Science, vol 5218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87779-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-87779-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87778-3
Online ISBN: 978-3-540-87779-0
eBook Packages: Computer ScienceComputer Science (R0)