Analysis of accelerated gossip algorithms
Gossiping is a distributed process whose purpose is to enable the members of a group of n>1 autonomous agents to asymptotically determine in a decentralized manner, the average of the initial values of their scalar gossip variables. This paper analyzes the accelerated gossip algorithms, first proposed in Cao, Spielman, and Yeh (2006), in which local memory is exploited by installing shift-registers at each agent. For the two-register case, the existence of the desired convergence is established...[Show more]
|Collections||ANU Research Publications|
|01_Liu_Analysis_of_accelerated_gossip_2013.pdf||2.34 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.