Abstract
We propose a self-stabilizing probabilistic solution for the neighborhood unique naming problem in uniform, anonymous networks with arbitrary topology. This problem is important in the graph theory Our solution stabilizes under the unfair distributed scheduler. We prove that this solution needs in average only one trial per processor. We use our algorithm to transform the [6] maximal matching algorithm self-stabilizing to be able to cope up with a distributed scheduler.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the ACM, vol. 17 (1974) 643–644
Ghosh, S., and Karaata, M. H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing, 7 (1993) 55–59
Gradinariu, M., and Tixeuil, S.: Tight space uniform self-stabilizing l-mutual exclusion. Technical Report 1249, Laboratoire de Recherche en Informatique (2000)
Griggs, J.R., and Yeh., R. K.: Labeling graphs with a condition at distance two. SIAM, Journal of Discrete Mathematics, 5 (1992) 586–595
Hsu, S., and Huang, S.: A self-stabilizing algorithm for maximal matching. In Information Processing Letters, 43(2) (1992) 77–81
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)
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
Schneider M.: Self-stabilization. ACM Computing Surveys, 25 (1993), 45–67
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dep. of Electrical EnG. and Comp. Science (1995)
Segala, R., and Lynch, N.: Probabilistic simulations for probabilistic processes. In LNCS, CONCUR’ 94, Concurrency Theory, 5th International Conference, Vol. 836 (1994)
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
Shukla, S., Rosenkrantz, D., and Ravi, S.: Observations on self-stabilizing graph algorithms for anonymous networks. In Proc. of the Second Workshop on Self-stabilizing Systems, pages 7.1–7.15 (1995)
Sur S., and Srimani P. K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Sciences, 69 (1993) 219–227
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gradinariu, M., Johnen, C. (2001). Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_67
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive