An implementable dynamic automatic self-stabilizing protocol

3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997

Volumn , Issue , 1997, Pages 91-97

  Flauzac, O ^a   Villain, V ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; MEMORY ARCHITECTURE; MESSAGE PASSING; NETWORK ARCHITECTURE;

ASYNCHRONOUS MESSAGE-PASSING MODELS; COMMUNICATION GRAPHS; DIJKSTRA; GLOBAL STATE; MEMORY STATE; MESSAGE COMPLEXITY; SELF STABILIZATION; SELF-STABILIZING PROTOCOL;

PARALLEL ARCHITECTURES;

EID: 84868293891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.1997.645076     Document Type: Conference Paper

References (15)

1. Y. Afek and GM. Brown. Self-stabilization over unreliable communication media. Distributed Computing, 7:27-34, 1993.
2. Y. Afek, S. Kutten, and M. Yung. Memory-efficient self-stabilizating protocol for general network. In Springer-Verlag, editor, Lecture Notes in Computer Science, volume 486, pages 15-28. 4th Int. Workshop on Distributed Algorithms, 1990.
3. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local cheking and correction. In FOCS91 Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 268-277, 1991.
4. KM. Chandy and L. Lamport. Distributed snapshot determining global states of distributed systems. ACM transaction computing system, 3:63-75, 1985.
5. NS. Chen, HP. Hu, and ST. Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147-151, 1991.
6. S. Delaet. Auto-stablisation : Modele et application a I'exclusion mutuelle. PhD thesis, Orsay, 1995.
7. EW Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643-644, 1974.
8. S. Dolev, A. Israeli, and S. Moran. resource bounds for self-stabilizing message driven protocols. In PODC91 Proceedings of the Tenth Annual ACM Symposium on Principles of distributed Computing, pages 281-293, 1991.
9. S. Dolev, A. Israeli, and S Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993.
10. S. Dolev, A. Israeli, and S. Moran. Resource bounds for self-stabilizing message driven protocols. SIAM journal of computing, 26:273-290, 1997.
11. ST. Huang and NS. Chen. A self-stabilizing algorithm for constructing breadth-first trees. Information Processing Letters, 41:109-117, 1992.
12. S. Katz and KJ. Perry. Self-stabilizing extensions for message-passing systems. In PODC90 Proceedings of Th 9th Annual ACM Symposium of Distributed Computing, pages 91-101, 1990.
13. S. Katz and KJ. Pery. Self-stabilizing extensions for message-passing systems. Distributed Computing, 7:17-26, 1993.
14. F. Petit and V. Villain. Color optimal self-stabilizing depth-first token circulation protocol for asynchronous message-passing. In ISCA, editor, PDCS97 10th International Conference on Parallel and Distributed Computing Systems Proceedings, 1997.
15. M. Schneider. Self-stabilization. ACM Computing Surveys, 25:45-67, 1993.