On snapshots and stable properties detection in anonymous fully distributed systems

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

Volumn 7355 LNCS, Issue , 2012, Pages 207-218

  Chalopin, Jérémie ^a   Métivier, Yves ^b   Morsellino, Thomas ^b  

^a AIX MARSEILLE UNIV   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS NETWORKS; DISTRIBUTED SYSTEMS; SNAPSHOT ALGORITHMS; STABLE PROPERTY; UNIQUE IDENTIFIERS; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

COMMUNICATION;

EID: 84864070600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31104-8_18     Document Type: Conference Paper

References (23)

1. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82-93 (1980)
2. Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. John Wiley & Sons (2004)
3. 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 (1996)
4. 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 (1999)
5. Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math. 243, 21-66 (2002)
6. Chalopin, J.: Algorithmique distribuée, calculs locaux et homorphismes de graphes. PhD thesis, université Bordeaux 1 (2006)
7. Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63-75 (1985)
8. Chalopin, J., Métivier, Y.: An efficient message passing election algorithm based on mazurkiewicz's algorithm. Fundam. Inform. 80(1-3), 221-246 (2007)
9. Guerraoui, R., Ruppert, E.: What Can Be Implemented Anonymously? In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 244-259. Springer, Heidelberg (2005)
10. Gross, J.L., Tucker, T.W.: Topological graph theory. Wiley Interscience (1987)
11. Johnson, R.E., Schneider, F.B.: Symmetry and similarities in distributed systems. In: Proc. 4th Conf. on Principles of Distributed Computing, pp. 13-22 (1985)
12. Kshemkalyani, A.D., Raynal, M., Singhal, M.: An introduction to snapshot algorithms in distributed computing. Distributed Systems Engineering 2(4), 224-233 (1995)
13. Kshemkalyani, A.D., Singhal, M.: Distributed computing, Cambridge (2008)
14. Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters 61, 233-239 (1997)
15. Matocha, J., Camp, T.: A taxonomy of distributed termination detection algorithms. Journal of Systems and Software 43(3), 207-221 (1998)
16. Raynal, M.: Networks and distributed computation. MIT Press (1988)
17. Santoro, N.: Design and analysis of distributed algorithm. Wiley (2007)
18. Schiper, A., Sandoz, A.: Strong stable properties in distributed systems. Distributed Computing 8(2), 93-103 (1994)
19. Szymanski, B., Shy, Y., Prywes, N.: Synchronized distributed termination. IEEE Transactions on Software Engineering SE-11(10), 1136-1140 (1985)
20. Tel, G.: Introduction to distributed algorithms. Cambridge University Press (2000)
21. Yamashita, M., Kameda, T.: Computing functions on asynchronous anonymous networks. Math. Systems Theory 29, 331-356 (1996)
22. 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)
23. 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)