Sciweavers

Share
CDC
2010
IEEE

A lower bound for distributed averaging algorithms on the line graph

9 years 1 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose state consists of a single real number and whose (possibly nonlinear) update function satisfies a natural smoothness condition has a worst case running time of at least on the order of n2 on a line network of n nodes. Our results suggest that increased memory or expansion of the state space is crucial for improving the running times of distributed averaging algorithms.
Alexander Olshevsky, John N. Tsitsiklis
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2010
Where CDC
Authors Alexander Olshevsky, John N. Tsitsiklis
Comments (0)
books