Simple and efficient network decomposition and synchronization

Theoretical Computer Science

Volumn 243, Issue 1-2, 2000, Pages 217-241

  Moran, Shlomo ^a   Snir, Sagi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Asynchronous communication networks; Graph decompositions; Synchronizers

Indexed keywords

EID: 0346676540     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00206-0     Document Type: Article

References (15)

1. Y. Afek, M. Ricklin, Sparser: a paradigm for running distributed alogorthms, J. Algorithms 14 (1993) 316-328.
2. B. Awerbuch, Complexity of network synchronization, J. ACM 32(4) (1985) 804-825.
3. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in: Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 230-240.
4. B. Awerbuch, A.V. Goldberg, M. Luby, S.A. Plotkin, Network decomposition and locality in distributed computation, in: 30th Ann. Symp. on Foundations of Computer Science, 30 October-1 November 1989, pp. 364-369.
5. B. Awerbuch, D. Peleg, Efficient distributed construction of sparse covers, Tech. Report CS90-17, Weizmann Institute, July 1990.
6. B. Awerbuch, D. Peleg, Network synchronization with polylogarithmic overhead, in: Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 514-522.
7. B. Awerbuch, D. Peleg, Sparse partitions, in: Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 514-522.
8. B. Awerbuch, D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. Discrete Math. 5 (1992) 151-162.
9. B. Awerbuch, D. Peleg, Online tracking of mobile usuers, J. ACM 42 (5) (1995) 1021-1058.
10. S. Even, Graph Algorithms, Computer Science Press, Woodland Hills, CA, 1979.
11. M. Faloutsos, M. Molle, Optimal distributed algorithms for minimum spanning trees, revisited, in: Proc. 14 ACM Symp. Principles of Distributed Computing, 1995, pp. 231-237.
12. R.G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimum weight spanning trees, ACM Trans. Program. Lang. Syst. 5(1) (1983) 66-77.
13. N. Linial, M. Saks, Low diameter graph decompositions, Combinatorica 13 (1993) 441-454.
14. D. Peleg, Sparse graph partitions, Tech. Report CS89-01, Weizmann Institute, February 1989.
15. L. Shabtay, A. Segall, Low complexity network synchronization, in: Proc. 8th Internat. Workshop on Distributed Algorithms, 1994, pp. 223-237.