Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 52-61

  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

ALGORITHMS; COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; PERTURBATION TECHNIQUES; PROBABILITY; PROGRAM PROCESSORS; SCHEDULING;

MEMORY SPACE; MUTUAL EXCLUSION; SERVICE TIME; UNIDIRECTIONAL RINGS;

ROBUSTNESS (CONTROL SYSTEMS);

EID: 12444309363     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ipdps.2004.1302973     Document Type: Conference Paper

References (21)

1. J. Beauquier, S. Cordier, and S. Delaët. Optimum probabilistic self-stabilization on uniform rings. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 15.1-15.15, 1995.
2. J. Beauquier, M. Gradinariu, and C. Johnen. Memory space requirements for self-stabilizing leader election protocols. In PODC99 Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pages 199-208, 1999.
3. J. Beauquier, M. Gradinariu, and C. Johnen. Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Technical Report 1225, L.R.I, December 1999.
4. J. Beauquier, M. Gradinariu, and C. Johnen. Cross-over composition - enforcement of fairness under unfair adversary. In WSS01 Proceedings of the Fifth International Workshop on Self-Stabilizing Systems, Springer LNCS:2194, pages 19-34, 2001.
5. J. Beauquier, M. Gradinariu, C. Johnen, and J. Durand-Lose. Token-based self-stabilization uniform algorithms. Journal of Parallel and Distributed Computing, 62(5):899-921, 2002.
6. A. Datta, M. Gradinariu, and S. Tixeuil. Self-stabilizing mutual exclusion using unfair distributed scheduler. In IPDPS'2000 Proceedings of the 14th International Parallel and Distributed Processing Symposium, pages 465-470, 2000.
7. E. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17(11):643-644, 1974.
8. S. Dolev, A. Israeli, and S. Moran. Analyzing expected time by scheduler-luck games. IEEE Transactions on Software Engineering, 21:429-439, 1995.
9. J. Durand-Lose. Randomized uniform self-stabilizing mutual exclusion. Information Processing Letters, 74(5-6):203-207, 2000.
10. F. Fich and C. Johnen. A space optimal, deterministic, self-stabilizing, leader election algorithm for unidirectional rings. In DISC01 Distributed Computing 15th International Symposium, Springer LNCS:2180, pages 224-239, 2001.
11. T. Herman. Probabilistic self-stabilization. Information Processing Letters, 35(2):63-67, 1990.
12. T. Herman. Self-stabilization: randomness to reduce space. Distributed Computing, 6:95-98, 1992.
13. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC90 Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, pages 119-131, 1990.
14. C. Johnen. Service time optimal self-stabilizing token circulation protocol on anonymous unidrectional. In SRDS 2002 21st Symposium on Reliable Distributed Systems, IEEE Computer Society Press, pages 80-89, 2002.
15. H. Kakugawa and M. Yamashita. Uniform and self-stabilizing token rings allowing unfair daemon. IEEE Transactions on Parallel and Distributed Systems, 8(2):154-162, 1997.
16. H. Kakugawa and M. Yamashita. Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon. Journal of Parallel and Distributed Computing, 62(5):885-898, 2002.
17. A. Mayer, Y. Ofek, R. Ostrovsky, and M. Yung. Self-stabilizing symmetry breaking in constant-space. In STOC92 Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 667-678, 1992.
18. L. Rosaz. Self-stabilizing token circulation on asynchronous uniform unidirectional rings. In PODC00 Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pages 249-258, 2000.
19. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Departament of Electrical Engineering and Computer Science, 1995.
20. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In CONCUR'94 Fifth International Conference Concurrency Theory, Springer-Verlag LNCS:836, pages 481-496, 1994.
21. S. Wu, S. Smolka, and E. Stark. Composition and behaviors of probabilistic I/O automata. In CONCUR'94 Fifth International Conference Concurrency Theory, Springer-Verlag LNCS:836, pages 513-528, 1994.