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

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

doi:10.1137/S0097539704441848

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

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

Research output: Contribution to journal › Article › peer-review

109 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 which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every other process. If message size is Θ(n^e) for some ε > 0, then the number of communication rounds is O(log 1/ε).

Original language	English
Pages (from-to)	120-131
Number of pages	12
Journal	SIAM Journal on Computing
Volume	35
Issue number	1
DOIs	https://doi.org/10.1137/S0097539704441848
State	Published - 7 Mar 2006
Externally published	Yes

Keywords

Distributed algorithms
Minimum-weight spanning tree

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1137/S0097539704441848

Cite this

@article{c1c1d78ddf504f40a72ff3b201efc527,

title = "Minimum-weight spanning tree 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 which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every other process. If message size is Θ(ne) for some ε > 0, then the number of communication rounds is O(log 1/ε).",

keywords = "Distributed algorithms, Minimum-weight spanning tree",

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

year = "2006",

month = mar,

day = "7",

doi = "10.1137/S0097539704441848",

language = "English",

volume = "35",

pages = "120--131",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "1",

}

TY - JOUR

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

AU - Lotker, Zvi

AU - Patt-Shamir, Boaz

AU - Pavlov, Elan

AU - Peleg, David

PY - 2006/3/7

Y1 - 2006/3/7

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 which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every other process. If message size is Θ(ne) for some ε > 0, then the number of communication rounds is O(log 1/ε).

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 which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every other process. If message size is Θ(ne) for some ε > 0, then the number of communication rounds is O(log 1/ε).

KW - Distributed algorithms

KW - Minimum-weight spanning tree

UR - https://www.scopus.com/pages/publications/33644585189

U2 - 10.1137/S0097539704441848

DO - 10.1137/S0097539704441848

M3 - Article

AN - SCOPUS:33644585189

SN - 0097-5397

VL - 35

SP - 120

EP - 131

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 1

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this