|
[AN99] A. Arora and M.Nesterenko. Stabilization-preserving atomicity refinement. DISC’99 Proceedings of the Thirteenth International Symposium on Distributed Computing, pp. 254-268, 1999. [AS96] G. Antonoiu and P. K. Srimani, A Self-stabilizing leader election algorithm for tree graphs, Journal of Parallel and Distributed Computing, 34, p.227-232, 1996. [BD95] J. Beaquier J, O. Debas, An optimal self-stabilizing algorithm for mutual exclusion on bidirectional non uniform rings, Proc. Second Workshop Self-Stabilizing System, 1995. [BDGM00] J. Beauquier, A. K. Datta, M. Gradinariu, and F. Magniette. A Self-stabilizing local mutual exclusion and daemon refinement. DISC’00 Proceedings of the Fourteen International Symposium on Distributed Computing, 2000. [BP89] J. E. Burns, J. Pachl, Uniform self-stabilizing rings. ACM Trans. Program Lang. Syst. 11(2): 330-344, 1989.
[D71] E.W. Dijkstra Hierarchical Ordering of Sequential Processes. Acta Informatica 1 (1971), 115-138 [D74] E.W. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery, 17:643-644, 1974.
[DI97] S. Dolev, A. Israeli, and S. Moran. Uniform dynamic self-stabilizing leader election, IEEE Trans. On Parallel and Distributed Systems. Vol.8, No 4, April 1997. [DIM93] S. Dolev, A. Israeli, and S. Moran, Self-stabilizing of dynamic systems assuming only read/write atomicity. Distributed Computing, 7:3-16, 1993. [DJPV00] A. K. Datta, C. Johnen, F. Petit and V. Villain, Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing, 13: 207-218, 2000.
[GK93] S. Ghosh and M.H. Karaata, A self-stabilizing algorithm for coloring planar graph, Distributed Computing, pp. 7:55-59, 1993. [GH99] M. G. Gouda and F. Haddix. The alternator. Proc. the 3rd Workshop on Self-stabilizing Systems (published in association with Proc. the 19th IEEE International Conference on Distributed Computing Systems), pp. 48-53, 1999.
[GT00] M. Gradinariu and S. Tixeuil, Self-stabilizing vertex coloring of arbitrary graphs, OPODIS’2000, pp.17-36, 2000. [H00] S. T. Huang. The fuzzy philosophers. Lecture notes in Computer Science 1800, IPDPS 2000 Workshops, Cancun, Mexico, May 1-5, 2000, pp. 130-136. [H94] J. H. Hoepman, Uniform deterministic self-stabilizing ring orientation on Odd-Length Ring, Proc. Eighth Int’l Workshop Distributed Algorithms, pp.265-279, 1994. [H98] J. H. Hoepman, Self-stabilizing ring orientation using constant space, Information and Computation, Vol.144, No 1 ,pp. 18-39, 1998. [HC00] S. T. Huang and B. W. Chen. The optimal 1-fair alternators. Information processing Letter. 2000. [HC93] S. T. Huang and N. S. Chen, Self-stabilizing depth-first token circulation on networks. Distributed Computing, 7:61-66, 1993.
[HJS03] S.T. Hedetniemi, D.P. Jacobs and P.K. Srimani, Linear time self-stabilizing colorings, Information Processing Letters, 87:251-255, 2003. [HP92] D. Hoover and J Poole. A distributed self-stabilizing solution to the dining philosophers problem. Information Processing Letters, 41:209-213, 1992. [HR96] H. J. Hoover and P. Rudnicki, Uniform self-stabilizing orientation of unicyclic networks under read/write atomicity. Chicago Journal of Theoretical Computer Science, 1996. [HW97] S. T. Huang and L.C. Wuu, Self-stabilizing token circulation in uniform networks. Distributed Computing, 10:181-187, 1997. [HWT94] S. T. Huang, L.C. Wuu and M. S. Tsai, Distributed execution model for self-stabilizing systems, Proc. of the 14th IEEE International Conference on Distributed Computing System, 1994. [IJ90] A. Israeli and M. Jalfon, Self-stabilizing ring orientation, Proc. Fourth Int’l Workshop Distributed Algorithms, pp. 1-14, 1990. [IJ93] A. Israeli and M. Jalfon, Uniform self-stabilizing ring orientation, Information and Coputation, vol. 104, pp. 175-196, 1993. [JABD97] C. Johnen, G. Alari, J. Beaquier and A.K. Datta, Self-stabilizing depth-first token passing on rooted networks. In WDAG97 Distributed Algorithms 11th International Workshop Processings, Springer-Verlag LNCS:1320, pp. 260-274,1997. [JADT99] C Johnen, LO Alima, AK Datta, and S Tixeuil. Self-stabilizing neighborhood synchronizer in tree networks. In ICDCS99 The 19th IEEE International Conference on Distributed Computing Systems, pp. 487-494, 1999. [JBD95] C. Johnen and J. Beaquier, O. Debas, Space-efficient distributed self-stabilizing depth-first token circulation. In proceedings of the second Workshop on Self-Stabilizing Systems, p.4.1-4.15, 1995.
[JT95] T.R. Jensen and B. Toft, Graph coloring problems, John Wiley & Sons, New York, 1995.
[L96] N. Lynch, Distributed Algorithms, Morgan Kaufmann,1996. [LH97] T. J. Liu and S.T. Huang, Leader election in uniform trees, Proc. 10th International Conference on Parallel and Distributed Comuting Systems, pp. 477-180, 1997. [P01] F. Petit, Fast Self-stabilizing depth-first token circulation. The 5th International Workshop on Self-Stabilizing Systems (WSS '01), LNCS 2194, pp. 200-215, 2001. [P97] F. Petit, Highly space-efficient self-stabilizing depth-first token circulation for trees. In OPOSDIS'97, International Conference On Principles Of Distributed System Proc., p221-235. 1997. [PV00a] F. Petit, V. Villain, Time and space optimality of distributed depth-first token circulation algorithms. DIMACS Workshop on Distributed Data and Structures, Carleton Univerty Press, pp. 91-106, 1999. Also presented at Dagsthul Workshop on SS (October 2000). [PV00b] F. Petit, V. Villain, Optimality and self-stabilization in rooted tree networks. Parallel Processing Letters, 10(1):3-14, 2000. [PV97] F. Petit, V. Villain, Color optimal self-stabilizing depth-first token circulation. Third International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97), IEEE Computer Society Press, pp. 317-323, 1997.
[SR94] S. Shukla, D.Rosenkrantz and S. Ravi, Development self-stabilizing coloring algorithms via systematic randomization. In Processing of the International Workshop on Parallel Processing, pp. 668-673, 1994.
[SS93] S. Sur and P.K. Srimani, A self-stabilizing algorithm for coloring bipartite graphs. Information Science, 69:2219-227, 1993. [TH95] M. S. Tsai and S. T. Huang, Self-stabilizing ring orientation protocols, Proc. Second Workshop Self-Stabilizing System, 1995. [UKY98] N. Uemoto, H. Kakugawa, and M. Yamashita, A self-stabilizing ring orientation algorithm with a smaller number of processor States, IEEE Trans. On Parallel and Distributed Systems. Vol.9, June 1998.
|