Minimum-weight spanning tree construction in O(log log n) communication rounds

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 120-131

  Lotker, Zvi ^a   Patt Shamir, Boaz ^a   Pavlov, Elan ^b   Peleg, David ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Distributed algorithms; Minimum weight spanning tree

Indexed keywords

ALGORITHMS; COMMUNICATION; MATHEMATICAL MODELS;

DISTRIBUTED ALGORITHMS; MINIMUM-WEIGHT SPANNING TREE;

TREES (MATHEMATICS);

EID: 33644585189     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704441848     Document Type: Article

References (15)

1. M. ADLER, W. DITTRICH, B. JUURLINK, M. KUTYLOWSKI, AND I. RIEPING, Communication-optimal parallel minimum spanning tree algorithms, in Proceedings of the 1998 ACM Symposium on Parallel Algorithms and Architecture, 1998, pp. 27-36.
2. B. AWERBUCH, Complexity of network synchronization, J. ACM, 32 (1985), pp. 804-823.
3. B. AWERBUCH, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 230-240.
4. B. AWERBUCH AND Y. SHILOACH, New connectivity and MSF algorithms for the shuffle-exchange network and PRAM, IEEE Trans. Comput., 36 (1987), pp. 1258-1263.
5. R. COLE, P. N. KLEIN, AND R. E. TRAJAN, Finding minimum spanning forests in logarithmic time and linear work using random sampling, in Proceedings of the ACM Symposium on Parallel Algorithms and Architecture, 1996, pp. 243-250.
6. R. G. GALLAGER, P. A. HUMBLET, AND P. M. SPIRA, A distributed algorithm for minimum-weight spanning trees, ACM Trans. Prog. Lang. and Syst., 5 (1983), pp. 66-77.
7. J. A. GARAY, S. KUTTEN, AND D. PELEG, A sublinear time distributed algorithm for minimum-weight spanning trees, SIAM J. Comput., 27 (1998), pp. 302-316.
8. J. JANNOTTI, D. GIFFORD, K. L. JOHNSON, M. F. KAASHOEK, AND J. J. W. O'TOOLE, Overcast: Reliable multicasting with an overlay network, in Proceedings of the 4th Annual USENIX OSDI, 2000, pp. 197-212.
9. D. R. KARGER, P. N. KLEIN, AND R. E. TARJAN, A randomized linear time algorithm to find minimum spanning trees, J. ACM, 42 (1995), pp. 321-328.
10. Z. LOTKER, B. PATT-SHAMIR, AND D. PELEG, Distributed MST for constant diameter graphs, in Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, 2001, pp. 63-71.
11. N. LYNCH, Distributed Algorithms, Morgan Kaufmann, San Mateo, CA, 1995.
12. D. PELEG AND V. RUBINOVICH, Near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction, SIAM J. Comput., 30 (2000), pp. 1427-1442.
13. J. H. SALTZER, D. P. REED, AND D. D. CLARK, End-to-end arguments in system design, ACM Transactions on Computer Systems, 2 (1984), pp. 277-288.
14. I. STOICA, R. MORRIS, D. KARGER, M. F. KAASHOEK, AND H. BALAKRISHNAN, Chord: A scalable peer-to-peer lookup service for internet applications, in Proceedings of the ACM SIGCOMM '01 Conference, San Diego, CA, 2001.
15. R. E. TARJAN, Data Structures and Network Algorithms, CBMS-NSF Regional Conf. Ser. in Appl. Math. 44, SIAM, Philadelphia, 1983.