Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 202-211

  Kakugawa, Hirotsugu ^a   Yamashita, Masafumi ^b  

^a HIROSHIMA UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; SCHEDULING; TOPOLOGY; TREES (MATHEMATICS);

PROCESS IDENTIFIERS;

TELECOMMUNICATION NETWORKS;

EID: 0036443139     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. G. Antonoiu and P.K. Srimani. Mutual exclusion between neighboring nodes in a tree that stabilizes using read/write atomicity. In Proceedings of EURO-PAR'98 Parallel Processing, 1998.
2. G. Antonoiu and P.K. Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In Proceedings of EURO-PAR'99 Parallel Processing, 1999.
3. J. Beauquier, A.K. Datta, M. Gradinariu, and F. Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In Proceedings of the 14th Conference on Distributed Computing (DISC), LNCS 2180, pages 240-254, 2000.
4. James E. Burns and Jan Pachl. Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems, 11(2):330-344, April 1989.
5. K.M. Chandy and J. Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632-646, October 1984.
6. E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, November 1974.
7. F.C. Gar̈tner. Fundamentals of fault-tolerant distributed computing in asynchronous environments. Journal of Parallel and Distributed Computing, 35:43-48, 1996.
8. M.G. Gouda. The triumph and tribulation of system stabilization. In 9th International Workshop on Distributed Algorithms (WDAG), LNCS: 972, pages 1-18. Springer-Verlag, 1995.
9. Mohamed G. Gouda and Furman Haddix. The alternator. In Proceedings of the Second Workshop on Self-Stabilizing Systems (WSS99), pages 48-53, 1999.
10. M. Gradinariu and S. Tixeuil. Self-stabilizing vertex coloring of arbitrary graphs. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS), pages 55-70, 2000.
11. Shing-Tsaan Huang. Leader election in uniform rings. ACM Transactions on Programming Languages and Systems, 15(3):563-573, July 1993.
12. Shing-Tsaan Huang. The fuzzy philosophers. In Proceedings of the International Parallel and Distributed Processing Symposium, Workshop on Advances in Parallel and Distributed Computational Models, Lecture Notes in Computer Science 1800, pages 130-136. Springer-Verlag, May 2000.
13. H. Kakugawa and M. Yamashita. Uniform and self-stabilizing token rings allowing unfair daemon. IEEE Transactions on Parallel and Distributed Systems, 8(2): 154-163, February 1996.
14. S. Katz and K.J. Perry. Self-stabilizing extensions for message-passing systems. Distributed Computing, 7:17-26, 1993.
15. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, July 1978.
16. M. Mizuno and H. Kakugawa. A transformation of self-stabilizing programs for distributed computing environments. In 10th International Workshop on Distributed Algorithms (WDAG), LNCS 1151, pages 304-321. Springer-Verlag, 1996.
17. M. Mizuno, M. Nesterenko, and H. Kakugawa. Lock based self-stabilizing distributed mutual exclusion algorithms. In the 16th International conference on Distributed Computing Systems (ICDCS), pages 708-716, May 1996.
18. M. Nesterenko and A. Arora. Stabilization preserving atomicity refinement. In Proceedings of the 13th International Symposium on Distributed Computing, pages 254-268, Bratislava, Slovak Republic, September 1999.
19. M. Schneider. Self-stabilization. ACM Computing Surveys, 25(1):45-67, March 1993.
20. M. Yamashita and T. Kameda. Computing on anonymous networks: Part I: characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems, 7(1):69-89, January 1996.
21. M. Yamashita and T. Kameda. Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on Parallel and Distributed Systems, 10:878-889, 1999.