Sciweavers

DCOSS
2010
Springer

Fast Decentralized Averaging via Multi-scale Gossip

13 years 7 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Gossip which employs a hierarchical decomposition of the graph to partition the computation into tractable sub-problems. Using only pairwise messages of fixed size that travel at most O(n 1 3 ) hops, our algorithm is robust and has communication cost of O(n log log n log -1 ) transmissions, which is order-optimal up to the logarithmic factor in n. Simulated experiments verify the good expected performance on graphs of many thousands of nodes.
Konstantinos I. Tsianos, Michael G. Rabbat
Added 02 Sep 2010
Updated 02 Sep 2010
Type Conference
Year 2010
Where DCOSS
Authors Konstantinos I. Tsianos, Michael G. Rabbat
Comments (0)