Zvi Lotker
ABSTRACT
We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(log n) bits. For this model, we present a distributed algorithm that constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to each other process. This result is the first to break the ω(log n) parallel time complexity barrier with small message sizes.
- M. Adler, W. Dittrich, B. Juurlink, M. Kutylowski, and I. Rieping. Communication-optimal parallel minimum spanning tree algorithms. In Proc. of the 1998 ACM Symposium on Parallel Algorithms and Architecture, pages 27--36, 1998. Google Scholar
Digital Library
- B. Awerbuch. Complexity of network synchronization. J. ACM, 32(4):804--823, Oct. 1985. Google ScholarDigital Library
- 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, pages 230--240, May 1987. Google ScholarDigital Library
- B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for the shuffle-exchange network and PRAM. IEEE Trans. Computers, C-36:1258--1263, 1987. Google ScholarDigital Library
- R. Cole, P. N. Klein, and R. E. Trajan. Finding minimum spanning forests in logarithmic time and linear work using random sampling. In Proc. of the 1996 ACM Symposium on Parallel Algorithms and Architecture, pages 243--250, 1996. Google ScholarDigital Library
- 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(1):66--77, Jan. 1983. Google ScholarDigital Library
- J. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput., 27:302--316, 1998. Google ScholarDigital Library
- J. Jannotti, D. Gifford, K. L. Johnson, M. F. Kaashoek, and J. J. W. O'Toole. Overcast: Reliable multicasting with an overlay network. In 4th USENIX OSDI, pages 197--212, October 2000. Google ScholarDigital Library
- D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear time algorithm to find minimum spanning trees. J. ACM, 42(4):321--328, 1995. Google ScholarDigital Library
- Z. Lotker, B. Patt-Shamir, and D. Peleg. Distributed MST for constant diameter graphs. In Proc. 20th Ann. ACM Symp. on Principles of Distributed Computing, pages 63--71, 2001. Google ScholarDigital Library
- N. Lynch. Distributed Algorithms. Morgan Kaufmann, San Mateo, CA, 1995. Google ScholarDigital Library
- D. Peleg and V. Rubinovich. Near-tight lower bound on the time complexity of distributed MST construction. SIAM J. Comput., 30:1427--1442, 2000. Google ScholarDigital Library
- J. H. Saltzer, D. P. Reed, and D. D. Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems, 2(4):277--288, Nov. 1984. Google ScholarDigital Library
- 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, California, August 2001. Google ScholarDigital Library
- R. E. Tarjan. Data Structures and network Algorithms, chapter 6. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1983. Google ScholarDigital Library
Index Terms
- MST construction in O(log log n) communication rounds
Recommendations
A deterministic algorithm for the MST problem in constant rounds of congested clique
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingIn this paper we show that the Minimum Spanning Tree problem (MST) can be solved deterministically in O(1) rounds of the Congested Clique model.
In the Congested Clique model there are n players that perform computation in synchronous rounds. Each ...
MST in Log-Star Rounds of Congested Clique
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingWe present a randomized algorithm that computes a Minimum Spanning Tree (MST) in O(log* n) rounds, with high probability, in the Congested Clique model of distributed computing. In this model, the input is a graph on n nodes, initially each node knows ...
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(log n) bits. For this model, we present a distributed algorithm which constructs a minimum-weight spanning ...
Comments