A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Goddard, Wayne ^a   Hedetniemi, Stephen T ^a   Jacobs, David P ^a   Srimani, Pradip K ^a  

^a AMRL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS;

ARBITRARY GRAPHS; ARBITRARY SYSTEMS; DISTRIBUTED SYSTEMS; PROTOCOL CANS; SELF STABILIZATION; SELF-STABILIZING DISTRIBUTED ALGORITHM; TOTAL DOMINATING SETS; TOTAL DOMINATION;

GRAPH THEORY;

EID: 84947253891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213437     Document Type: Conference Paper

References (12)

1. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, November 1974.
2. E. W. Dijkstra. A belated proof of self-stabilization. Distributed Computing, 1(1):5-6, 1986.
3. G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
4. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Mc-Grah Hill, 1998.
5. G Antonoiu and PK Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read/write atomicity. In Euro-Par'99 Parallel Processing, Proceedings LNCS:1685, pages 823-830, 1999.
6. J Beauquier, AK Datta, M Gradinariu, and F Magniette. Self-stabilizing local mutual exclusion and daemon refinement. In DISC00 Distributed Computing 14th International Symposium, Springer LNCS:1914, pages 223-237, 2000.
7. M Nesterenko and A Arora. Stabilization-preserving atomicity refinement. In DISC99 Distributed Computing 13th International Symposium, Springer LNCS:1693, pages 254-268, 1999.
8. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, 1998.
9. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, editors. Domination in Graphs: Advanced Topics. Marcel Dekker, 1998.
10. M. R. Garey and M. R. Johnson. Computers and Intractability. Freeman, New York, 1979.
11. S Ghosh, A Gupta, and MH Karaata SV Pemmaraju. Self-stabilizing dynamic programming algorithms on trees. In Proceedings of the SecondWorkshop on Self-Stabilizing Systems, pages 11. 1-11. 15, 1995.
12. S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. Self-stabilizing algorithms for minimal dominating sets. To appear in Computer Mathematics & Applications, 2002.