Color optimal self-stabilizing depth-first token circulation

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

Volumn , Issue , 1997, Pages 317-323

  Petit, F ^a   Villain, V ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; LOCKS (FASTENERS); MEMORY ARCHITECTURE; PARALLEL ARCHITECTURES; TREES (MATHEMATICS);

CONNECTED NETWORKS; MUTUAL EXCLUSIONS; SELF STABILIZATION; SELF-STABILIZING ALGORITHM; SELF-STABILIZING PROTOCOL; SPACE COMPLEXITY; SPANNING TREE; TOKEN CIRCULATION;

NETWORK ARCHITECTURE;

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

References (16)

1. G Antonoiu and PK Srimani. A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph. Computers and Mathematics with Applications, 30:1-7, 1995.
2. J Beauquier and C Johnen. Space-efficient distributed self-stabilizing depth-first token circulation. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 4.1-4.15, 1995.
3. GM Brown, MG Gouda, and CL Wu. Token systems that self-stabilize. IEEE Transactions on Computers, 38:845-852, 1989.
4. JE Burns and J Pachl. Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems, 11:330-344, 1989.
5. NS Chen, HP Yu, and ST Huang. A self-stabilizing algorithm for constructing spanning trees. Information Processing Letters, 39:147-151, 1991.
6. Z Collin and S Dolev. Self-stabilizing depth-first search. Information Processing Letters, 49:297-301, 1994.
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. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993.
9. O Fauzac and V Villain. An implementable dynamic automatic self-stabilizing protocol. In I-SPAN'97, Third International Symposium on Parallel Architectures, Algorithms and Networks Proceedings, IEEE Computer Society Press, 1997. to appear.
10. M Flatebo and AK Datta. Two-state self-stabilizing algorithms for token rings. IEEE Transactions on Software Engineering, 20:500-504, 1994.
11. S Ghosh. An alternative solution to a problem on self-stabilization. ACM Transactions on Programming Languages and Systems, 15:735-742, 1993.
12. ST Huang and NS Chen. A self-stabilizing algorithm for constructing breadth-first trees. Information Processing Letters, 41:109-117, 1992.
13. ST Huang and NS Chen. Self-stabilizing depth-first token circulation on networks. Distributed Computing, 7:61-66, 1993.
14. F Petit and V Villain. Color optimal self-stabilizing depth-first token circulation protocol for asynchronous message-passing. In PDCS-9710th International Conference on Parallel and Distributed Computing Systems Proceedings, ISCA, 1997. to appear.
15. F Petit and V Villain. A space-efficient and self-stabilizing depth-first token circulation protocol for asynchronous message-passing systems. In Euro-par'97 Parallel Processing, Proceedings LNCS:1300, pages 476-479. Springer-Verlag, 1997.
16. M Tchuente. Sur l'auto-stabilisation dans un reseau d'ordinateurs. RAIRO Informatique Theoretique, 15:47-66, 1981.