MST construction in O(log log n) communication rounds

Authors:
Zvi Lotker;Elan Pavlov;Boaz Patt-Shamir;David Peleg
Affiliations:
Tel Aviv University, Tel Aviv, Israel;Hebrew University, Jerusalem, Israel;Hewlett Packard, One Cambridge Center, Cambridge MA;-
Venue:
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2003

Citing 15
Cited 4

Data structures and network algorithms

Data structures and network algorithms
Complexity of network synchronization

Journal of the ACM (JACM)
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM

IEEE Transactions on Computers
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
Finding minimum spanning forests in logarithmic time and linear work using random sampling

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

SIAM Journal on Computing
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
End-to-end arguments in system design

ACM Transactions on Computer Systems (TOCS)
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed MST for constant diameter graphs

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms

Distributed Algorithms
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

SIAM Journal on Computing
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4

Facility location: distributed approximation

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A minimum spanning tree algorithm for efficient P2P video streaming system

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Collaborative measurements of upload speeds in P2P systems

INFOCOM'10 Proceedings of the 29th conference on Information communications
"Tri, tri again": finding triangles and small subgraphs in a distributed setting

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.