MST construction in O(log log n) communication rounds

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

doi:10.1145/777426.777428

MST construction in O(log log n) communication rounds

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

Research output: Contribution to conference › Paper › peer-review

58 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 language	English
Pages	94-100
Number of pages	7
DOIs	https://doi.org/10.1145/777426.777428
State	Published - 1 Jan 2003
Externally published	Yes
Event	Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - San Diego, SA, United States Duration: 7 Jun 2003 → 9 Jun 2003

Conference

Conference	Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
Country/Territory	United States
City	San Diego, SA
Period	7/06/03 → 9/06/03

Keywords

Communication round complexity
Minimum spanning tree
Sub-logarithmic protocols

ASJC Scopus subject areas

Software
Safety, Risk, Reliability and Quality

Access to Document

10.1145/777426.777428

Cite this

@conference{77a69bb7876b4fc4b9ce42987449336a,

title = "MST construction in O(log log n) communication rounds",

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.",

keywords = "Communication round complexity, Minimum spanning tree, Sub-logarithmic protocols",

author = "Zvi Lotker and Boaz Patt-Shamir and Elan Pavlov and David Peleg",

year = "2003",

month = jan,

day = "1",

doi = "10.1145/777426.777428",

language = "English",

pages = "94--100",

note = "Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures ; Conference date: 07-06-2003 Through 09-06-2003",

}

TY - CONF

T1 - MST construction in O(log log n) communication rounds

AU - Lotker, Zvi

AU - Patt-Shamir, Boaz

AU - Pavlov, Elan

AU - Peleg, David

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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.

AB - 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.

KW - Communication round complexity

KW - Minimum spanning tree

KW - Sub-logarithmic protocols

UR - http://www.scopus.com/inward/record.url?scp=0038041103&partnerID=8YFLogxK

U2 - 10.1145/777426.777428

DO - 10.1145/777426.777428

M3 - Paper

AN - SCOPUS:0038041103

SP - 94

EP - 100

T2 - Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures

Y2 - 7 June 2003 through 9 June 2003

ER -

MST construction in O(log log n) communication rounds

Abstract

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this