Abstract
The different local computations mechanisms are very useful for delimiting the borderline between positive and negative results in distributed computations. Indeed, they enable to study the importance of the synchronization level and to understand how important is the initial knowledge. A high level of synchronization involved in one atomic computation step makes a model powerful but reduces the degree of parallelism. Charron-Bost et al. [1] study the difference between synchronous and asynchronous message passing models. The model studied in this paper involves more synchronization than the message passing model: an elementary computation step modifies the states of two neighbours in the network, depending only on their current states. The information the processors initially have can be global information about the network, such as the size, the diameter or the topology of the network. The initial knowledge can also be local: each node can initially know its own degree for example. Another example of local knowledge is the existence of a port numbering: each processor locally gives numbers to its incident edges and in this way, it can consistently distinguish its neighbours. In Angluin’s model [2], it is assumed that a port numbering exists, whereas it is not the case in our model. In fact, we obtain a model with a strictly lower power of computation by relaxing the hypothesis on the existence of a port numbering.
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
Charron-Bost, B., Mattern, F., Tel, G.: Synchronous, asynchronous and causally ordered communication. Distributed Computing 9, 173–191 (1996)
Angluin, D.: Local and global properties in networks of processors. In: Proc. of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)
LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.) Information processing 1977, pp. 155–160. North-Holland, Amsterdam (1977)
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, 69–89 (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, 878–887 (1999)
Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters 61, 233–239 (1997)
Godard, E., Métivier, Y., Muscholl, A.: Characterization of classes of graphs recognizable by local computations. Theory of Computing Systems 37, 249–293 (2004)
Chalopin, J., Métivier, Y.: Election and local computations on edges (extended abstract). In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 90–104. Springer, Heidelberg (2004)
Mazurkiewicz, A.: Bilateral ranking negotiations. Fundamenta Informaticae 60, 1–16 (2004)
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)
Chalopin, J., Métivier, Y., Zielonka, W.: Election, naming and cellular edge local computations (extended abstract). In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 242–256. Springer, Heidelberg (2004)
Rosen, K.H. (ed.): Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalopin, J. (2005). Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30577-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24302-1
Online ISBN: 978-3-540-30577-4
eBook Packages: Computer ScienceComputer Science (R0)