Abstract
The point of departure and the motivation for this paper are the results of Angluin [1] which has introduced a tool to analyze the election algorithm: the coverings, Yamashita and Kameda [21] and Mazurkiewicz [15] which have obtained characterizations of graphs in which election is possible under two different models of distributed computations. Our aim is twofold. First it is to obtain characterizations of graphs in which election is possible under intermediate models between the models of Yamashita-Kameda and of Mazurkiewicz. Our second aim is to understand the implications of the models for the borderline between positive and negative results for distributed computations. In this work, characterizations are obtained under three different models.
Chapter 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. McGraw-Hill, New York (1998)
Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Press, Los Alamitos (1996)
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)
Godard, E., Métivier, Y.: A characterization of families of graphs in which election is possible (ext.abstrat). In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 159–171. Springer, Heidelberg (2002)
Godard, E., Métivier, Y., Muscholl, A.: Characterization of Classes of Graphs Recognizable by Local Computations. Theory of Computing Systems (to appear)
Godard, E., Métivier, Y., Tel, G.: Election, termination and graph cartography (in preparation)
LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.) Information processing 1977, pp. 155–160. North-Holland, Amsterdam (1977)
Lamport, L., Lynch, N.: Distributed computing: models and methods. Handbook of theoretical computer science, B:1157–1199 (1990)
Lynch, N.A.: Distributed algorithms. Morgan Kaufman, San Francisco (1996)
Massey, W.S.: A basic course in algebraic topology. Springer, Heidelberg (1991), Graduate texts in mathematics
Mazurkiewicz, A.: Trace theory. In: Brauer, W., et al. (eds.) Petri nets, applications and relationship to other models of concurrency. Lecture notes in computer science, vol. 255, pp. 279–324. Springer, Heidelberg (1987)
Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters 61, 233–239 (1997)
Métivier, Y., Tel, G.: Termination detection and universal graph reconstruction. In: SIROCCO 2000 - 7th International Colloquium on Structural Information & Communication Complexity, pp. 237–251 (2000)
Reidemeister, K.: Einführung in die Kombinatorische Topologie. Vieweg, Brunswick (1932)
Rosen, K.H. (ed.): Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton (2000)
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, 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)
Yamashita, M., Kameda, T.: Computing on anonymous networks: Part ii - decision and membership problems. IEEE Transactions on parallel and distributed systems 7(1), 90–96 (1996)
Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on parallel and distributed systems 10(9), 878–887 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J., Métivier, Y. (2004). Election and Local Computations on Edges. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive