Self-stabilizing neighborhood unique naming under unfair scheduler

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

Volumn 2150, Issue , 2001, Pages 458-465

  Gradinariu, Maria ^a   Johnen, Colette ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY;

ANONYMOUS NETWORKS; ARBITRARY TOPOLOGY; DISTRIBUTED SCHEDULERS; MAXIMAL MATCHINGS; PROBABILISTIC SOLUTION;

SCHEDULING;

EID: 84937419986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44681-8_67     Document Type: Conference Paper

References (15)

1. Beauquier, J., Gradinariu, M., and Johnen, C.: Randomized self-stabilizing optimal leader election under arbitrary scheduler on rings. Technical Report 1225, Laboratoire de Recherche en Informatique (1999)
2. Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the ACM, vol. 17 (1974) 643-644
3. Ghosh, S., and Karaata, M. H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing, 7 (1993) 55-59
4. Gradinariu, M., and Tixeuil, S.: Tight space uniform self-stabilizing l-mutual exclusion. Technical Report 1249, Laboratoire de Recherche en Informatique (2000)
5. Griggs, J. R., and Yeh, R. K.: Labeling graphs with a condition at distance two. SIAM, Journal of Discrete Mathematics, 5 (1992) 586-595
6. Hsu, S., and Huang, S.: A self-stabilizing algorithm for maximal matching. In Information Processing Letters, 43(2) (1992) 77-81
7. Micali, S., and Vazirani, V.: An algorithm for finding maximum matching in general graphs. In 21st IEEE Annual Symposium on Foundations of Computer Science (1980)
8. Pogosyants, A., Segala, R., and Lynch N.: Verification of the randomized consensus algorithm of Aspen and Herlihy: a case study. In Distributed Computing, 13 (2000), 155-186
9. Schneider M.: Self-stabilization. ACM Computing Surveys, 25 (1993), 45-67
10. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dep. of Electrical EnG. and Comp. Science (1995)
11. Segala, R., and Lynch, N.: Probabilistic simulations for probabilistic processes. In LNCS, CONCUR’94, Concurrency Theory, 5th International Conference, Vol. 836 (1994)
12. Shukla, S., Rosenkrantz, D., and Ravi, S.: Developing self-stabilizing coloring algorithms via systematic randomization. In Proc. of the Int. Workshop on Parallel Processing (1994) 668-673
13. Shukla, S., Rosenkrantz, D., and Ravi, S.: Observations on self-stabilizing graph algorithms for anonymous networks. In Proc. of the Second Workshop on Selfstabilizing Systems, pages 7.1–7.15 (1995)
14. Sur S., and Srimani P. K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Sciences, 69 (1993) 219-227
15. Wu, S. H., Smolka, S. A., and Stark, E. W.: Composition and behaviors of probabilistic i/o automata. In LNCS, CONCUR’94, Concurrency Theory, 5th International Conference, Vol. 836 (1994) 513-528