Space optimal PIF algorithm: Self-stabilized with no extra space

1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999

Volumn , Issue , 1999, Pages 20-26

  Bui, A ^a   Datta, A K ^b   Petit, F ^a   Villain, V ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b Las Vegas   (United States)

Author keywords

Distributed systems; fault tolerance; optimality; PIF; self stabilization

Indexed keywords

FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS;

DISTRIBUTED SYSTEMS; OPTIMALITY; PROPAGATION OF INFORMATION WITH FEEDBACK AND CLEANINGS; ROOTED TREES; SELF STABILIZATION; SENSE OF DIRECTIONS; SPACE REQUIREMENTS; SPANNING TREE;

TREES (MATHEMATICS);

EID: 84960966288     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCC.1999.749416     Document Type: Conference Paper

References (14)

1. L. 0. Alima, J. Beauquier, A. K. Datta, and S. Tixeuil. Self-stabilization with global rooted synchronizers. In ICDCS98 Proceedings of the 18th International Conference on Distributed Computing Systems, pages 102-109, 1998.
2. A Arora and MG Gouda. Distributed reset. IEEE Tmnsactions on Computers, 43:1026-1038, 1994.
3. B Awerbuch. Complexity of network synchronization. Journal of the Association of the Computing Machinery, 32(4):804-823, 1985.
4. B Awerbuch, S Kutten, Y Mansour, B Patt-Shamir, and G Varghese. Time optimal self-stabilizing synchronization. In STOC93 Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 652-661, 1993.
5. B Awerbuch and G Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In FOCS91 Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 258-267, 1991.
6. A Bui, AK Datta, F Petit, and V Villain. Space optimal and fast self-stabilizing PIF in tree networks. Technical Report RR 98-07, LaRJA, University of Picardie Jules Verne, 1998. Submitted.
7. E. Chang. Echo algorithm : Depth parall operations on general graphs. IEEE Tmnsactions on Software Engineering, 9:504-512, 1982.
8. NS Chen, HP Yu, and ST Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147-151, 1991.
9. EW Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643-644, 1974.
10. S Dolev, A Israeli, and S Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993.
11. HSM Kruijer. Self-stabilization (in spite of distributed control) in tree-structured systems. Information Processing Letters, 8:91-95, 1979.
12. A Segall. Distributed network protocols. IEEE Tmnsactions on Information Theory, IT-29:23-35, 1983.
13. G Varghese. Self-stabilization by counter flushing. In PODC94 Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pages 244-253, 1994.
14. V Villain. A new lower bound for self-stabilizing mutual exclusion algorithms. Technical Report RR97-17, LaRIA, University of Picardie Jules Verne, 1997.