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
Y1 - 2006
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 - http://www.scopus.com/inward/record.url?scp=33644585189&partnerID=8YFLogxK
U2 - 10.1137/S0097539704441848
DO - 10.1137/S0097539704441848
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.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 -