Analysis of accelerated gossip algorithms

J. Liu*, B. D.O. Anderson, M. Cao, A. S. Morse

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    19 Citations (Scopus)

    Abstract

    This paper investigates accelerated gossip algorithms for distributed computations in networks where shiftregisters are utilized at each node. By using tools from matrix analysis, we prove the existence of the desired acceleration and establish the fastest rate of convergence in expectation for two-register symmetric gossip. Some classes of networks with regular graph topologies are studied in detail to validate the analytical results by comparison with existing empirical data. We also analyze convergence of second moment and provide a necessary condition for convergence in multi-register symmetric gossip. The proposed approach has the potential to be applied to the more challenging open problem of asymmetric gossip.

    Original languageEnglish
    Title of host publicationProceedings of the 48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages871-876
    ISBN (Electronic)978-1-4244-3872-3
    ISBN (Print)978-1-4244-3871-6
    DOIs
    Publication statusPublished - 2009
    Event48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009 - Shanghai, China
    Duration: 15 Dec 200918 Dec 2009

    Publication series

    Name
    ISSN (Print)0191-2216

    Conference

    Conference48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
    Country/TerritoryChina
    CityShanghai
    Period15/12/0918/12/09

    Fingerprint

    Dive into the research topics of 'Analysis of accelerated gossip algorithms'. Together they form a unique fingerprint.

    Cite this