Accelerated gossip algorithms for distributed computation

44th Annual Allerton Conference on Communication, Control, and Computing 2006

Volumn 2, Issue , 2006, Pages 952-959

  Cao, Ming ^a   Spielman, Daniel A ^a   Yeh, Edmund M ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL METHODS; SHIFT REGISTERS;

DISTRIBUTED AVERAGING; DISTRIBUTED COMPUTATIONS; GOSSIP ALGORITHMS; INFOCOM; POWER METHOD; SPEED UP;

ALGORITHMS;

EID: 84940669992     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. of ACM Symposium on Theory of Computing, 2004.
2. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms: Design, analysis and applications," in Proc. of the 24th Conference of the IEEE Communications Society (INFOCOM), 2005.
3. J.-Y. Chen, G. Pandurangan, and D. Xu, "Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis," in Proc. of the 4th International Symposium on Information Processing in Sensor Networks (IPSN), 2005.
4. C. C. Moallemi and B. V. Roy, "Consensus propagation," IEEE Transactions on Information Theory. To appear.
5. D. Mosk-Aoyama and D. Shah, "Computing separable functions via gossip," in Proc. of the 25th annual ACM symposium on principles of distributed computing, 2005.
6. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient aggregation for sensor networks," in Proc. of the 5th International Symposium on Information Processing in Sensor Networks (IPSN), 2006.
7. D. M. Young, "Second-degree iterative methods for the solution of large linear systems," Journal of Approximation Theory, vol. 5, pp. 137-148, 1972.
8. R. Horn and C. R. Johnson, Matrix Analysis. New York: Cambridge University Press, 1985.