Spanning tree or gossip for aggregation: A comparative study

Lehel Nyers, Márk Jelasity

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Distributed aggregation queries like average and sum can be implemented in several different paradigms including gossip and hierarchical approaches. In the literature, these two paradigms are routinely associated with stereotypes such as "trees are fragile and complicated" and "gossip is slow and expensive". However, a closer look reveals that these statements are not backed up by thorough studies. A fair and informative comparison is clearly needed. However, it is a very hard task, because the performance of protocols from the two paradigms depends on different subtleties of the environment and the implementation of the protocols. We tackle this problem by carefully designing the comparison study. We use state-of-the-art algorithms and propose the problem of monitoring the network size in the presence of churn as the ideal problem for comparing very different paradigms for global aggregation. Our experiments help us identify the most important factors that differentiate between gossip and spanning tree aggregation: the time needed to compute a truly global output, the properties of the underlying topology, and the sensitivity to dynamism. We demonstrate the effect of these factors in different practically interesting topologies and scenarios. Our results help us to choose the right protocol in the knowledge of the topology and dynamism patterns.

Original languageEnglish
Title of host publicationEuro-Par 2014
Subtitle of host publicationParallel Processing - 20th International Conference, Proceedings
EditorsFernando Silva, Inês Dutra, Vítor Santos Costa
PublisherSpringer Verlag
Pages379-390
Number of pages12
ISBN (Electronic)9783319098722
ISBN (Print)9783319098722
DOIs
Publication statusPublished - Jan 1 2014
Event20th International Conference on Parallel Processing, Euro-Par 2014 - Porto, Portugal
Duration: Aug 25 2014Aug 29 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8632 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Conference on Parallel Processing, Euro-Par 2014
CountryPortugal
CityPorto
Period8/25/148/29/14

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Nyers, L., & Jelasity, M. (2014). Spanning tree or gossip for aggregation: A comparative study. In F. Silva, I. Dutra, & V. S. Costa (Eds.), Euro-Par 2014: Parallel Processing - 20th International Conference, Proceedings (pp. 379-390). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8632 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-09873-9_32