MST construction in O(log log n) communication rounds

Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, David Peleg

Research output: Contribution to conferencePaperpeer-review

54 Scopus citations

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.

Original languageEnglish
Pages94-100
Number of pages7
DOIs
StatePublished - 2003
Externally publishedYes
EventFifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - San Diego, SA, United States
Duration: 7 Jun 20039 Jun 2003

Conference

ConferenceFifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Country/TerritoryUnited States
CitySan Diego, SA
Period7/06/039/06/03

Keywords

  • Communication round complexity
  • Minimum spanning tree
  • Sub-logarithmic protocols

Fingerprint

Dive into the research topics of 'MST construction in O(log log n) communication rounds'. Together they form a unique fingerprint.

Cite this