Self-stabilizing mutual exclusion under arbitrary scheduler

Computer Journal

Volumn 47, Issue 3, 2004, Pages 289-298

  Datta, Ajoy K ^a   Gradinariu, Maria ^b   Tixeuil, Sébastien ^c  

^a UNIVERSITY OF NEVADA   (United States)

^b CAMPUS DE BEAULIEU   (France)

^c 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

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; PROGRAM PROCESSORS; THEOREM PROVING;

DISTRIBUTED SCHEDULER; MUTUAL EXCLUSION PROBLEM; PROBABILISTIC MODEL; SELF STABILIZING ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 2442527468     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/47.3.289     Document Type: Article

References (18)

1. Dijkstra, E. (1974) Self stabilizing systems in spite of distributed control. Commun. Assoc. Comput. Mach., 17, 643-644.
2. Dolev, S. (2000) Self-Stabilization. The MIT Press.
3. Perlman, R. (2000) Interconnections: Bridges, Routers, Switches, and Internetworking Protocols. Addison-Wesley Longman.
4. Beauquier, J., Gradinariu, M. and Johnen, C. (2001) Crossover composition. In Proc. Fifth Workshop on Self-Stabilizing Systems (WSS' 2001), pp. 19-34. Springer Verlag.
5. Dolev, S., Israeli, A. and Moran, S. (1995) Analyzing expected time by scheduler-luck games. IEEE Trans. Softw. Eng., 21, 429-439.
6. Burns, J. and Pachl, J. (1989) Uniform self-stabilizing rings. ACM Trans. Programm. Lang. Syst., 11, 330-344.
7. Flatebo, M. and Datta, A. (1994) Two-state self-stabilizing algorithms for token rings. IEEE Trans. Softw. Eng., 20, 500-504.
8. Herman, T. (1992) Self-stabilization: randomness to reduce space. Distributed Comput., 6, 95-98.
9. Beauquier, J., Cordier, S. and Delaët, S. (1995) Optimum probabilistic self-stabilization on uniform rings. In Proc. Second Workshop on Self-Stabilizing Systems, pp. 15.1-15.15. University of Nevada Las Vegas.
10. Herman, T. (1990) Probabilistic self-stabilization. Inform. Proc. Lett., 35, 63-67.
11. Kakugawa, H. and Yamashita, M. (1997) Uniform and self-stabilizing token rings allowing unfair daemon. IEEE Trans. Parall. Distributed Syst., 8, 154-162.
12. Pogosyants, A., Segala, R. and Lynch, N. (2000) Verification of the randomized consensus algorithm of Aspen and Herlihy: a case study. Distributed Comput., 13(4), 155-186.
13. Segala, R. and Lynch, N. (1994) Probabilistic simulations for probabilistic processes. In CONCUR'94. 5th Int. Conf. Concurrency Theory, Lecture Notes in Computer Science, 836, Uppsala, Sweden, pp. 481-496. Springer-Verlag.
14. Segala, R. (1995) Modeling and Verification of Randomized Distributed Real-Time Systems. Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT.
15. Wu, S. H., Smolka, S. A. and Stark, E. W. (1994) Composition and behaviors of probabilistic I/O automata. In CONCUR'94 Fifth Int. Conf. Concurrency Theory, Lecture Notes in Computer Science, 836, pp. 513-528. Springer-Verlag.
16. Israeli, A. and Jalfon, M. (1990) Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC'90 Proc. Ninth Ann. ACM Symp. on Principles of Distributed Computing, pp. 119-131. ACM Press.
17. Gradinariu, M. and Tixeuil, S. (2001) Tight space uniform self-stabilizing l-exclusion. In Proc. Int. Conf. on Distributed Computing Systems (ICDCS'2001), Phoenix, AZ, April, pp. 83-90. IEEE Press.
18. Durand-Lose, J. (2000) Randomized uniform self-stabilizing mutual exclusion. In Proc. Second Int. Conf. on Principles of Distributed Systems, pp. 89-98.