A self-stabilizing distributed algorithm to find the median of a tree graph

Journal of Computer and System Sciences

Volumn 58, Issue 1, 1999, Pages 215-221

  Antonoiu, Gheorghe ^a   Srimani, Pradip K ^a  

^a University Services Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; FORMAL LOGIC;

SELF-STABILIZING DISTRIBUTED ALGORITHMS;

TREES (MATHEMATICS);

EID: 0033076990     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1606     Document Type: Article

References (17)

1. A. Arora, S. Dolev, and M. Gouda, Maintaining digital clocks in step, Parallel Process. Lett. 1 (1) (1992), 11-18.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flows," Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. G. M. Brown, M. G. Gouda, and C. L. Wu, Token systems that self-stabilize, IEEE Trans. Comput. 38 (6) (1989), 845-852.
4. Z. Collin and S. Dolev, Self-stabilizing depth-first search, Inform. Process. Lett. 49 (1994), 297-301.
5. S. Chandrasekar and P. K. Srimani, A self-stabilizing distributed algorithm for all-pairs shortest path problem, Parallel Algorithms Appl. 4 (1&2) (1994), 125-137.
6. E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM 17 (11) (1974), 643-644.
7. E. W. Dijkstra, A belated proof of self-stabilization, J. Distrib. Comput. 1 (1) (1986), 5-6.
8. M. Flatebo and A. K. Datta, Two state self-stabilizing algorithms for token rings, IEEE Trans. Software Eng. 20(6) (1994), 500-504.
9. M. Gouda and T. Herman, Stabilizing unison, Inf. Process. Lett. 35(4) (1990), 171-175.
10. A. S. Gopal and K. J. Perry, Unifying self-stabilization and fault-tolerance, in "Proceedings of the 12th Symposium on Principles of Distributed Computing, Ithaca, New York, 1993," pp. 195-206.
11. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1972.
12. S. T. Huang, Leader election in uniform rings, ACM Trans. Programming Languages Systems 15(3) (1993), 563-573.
13. J. L. W. Kessels, An exercise in proving self-stabilization with a variant function, Inf. Process. Lett. 29(2) (1988), 39-42.
14. S. Katz and K. J. Perry, Self-stabilizing extensions for message passing systems, Distrib. Comput. 7(1) (1993), 17-26.
15. L. Lamport, Solved problems, unsolved problems, and non-problems in concurrency, in "Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing" (1984), pp. 1-11.
16. M. Schneider, Self-stabilization, ACM Comput. Surv. 25(1) (1993), 45-67.
17. G. Tel, "Introduction to Distributed Algorithms," Cambridge Univ. Press, Cambridge, 1994.