Brief announcement: Gossip-based aggregate computation: Computing faster with non address-oblivious schemes

Roberto Di Pietro; Pietro Michiardi

Brief announcement: Gossip-based aggregate computation: Computing faster with non address-oblivious schemes

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we sketch a novel gossip-based scheme that allows all the nodes in an n-node overlay network to compute a common aggregate (MAX) of their values using O(n log log n) messages within O(log n) rounds of communication. Our result is achieved relaxing the hypothesis that nodes are address-oblivious, raising the question whether this paradigm (address-aware) is more expressive than the address-oblivious one.

Original language	English (US)
Title of host publication	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
State	Published - Dec 17 2008
Externally published	Yes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-20

Cite this

@inproceedings{4b6ffda29d544ae0b237e7c1a299ad0b,

title = "Brief announcement: Gossip-based aggregate computation: Computing faster with non address-oblivious schemes",

abstract = "In this paper, we sketch a novel gossip-based scheme that allows all the nodes in an n-node overlay network to compute a common aggregate (MAX) of their values using O(n log log n) messages within O(log n) rounds of communication. Our result is achieved relaxing the hypothesis that nodes are address-oblivious, raising the question whether this paradigm (address-aware) is more expressive than the address-oblivious one.",

author = "Pietro, {Roberto Di} and Pietro Michiardi",

note = "Generated from Scopus record by KAUST IRTS on 2023-09-20",

year = "2008",

month = dec,

day = "17",

language = "English (US)",

isbn = "9781595939890",

booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

}

TY - GEN

T1 - Brief announcement: Gossip-based aggregate computation: Computing faster with non address-oblivious schemes

AU - Pietro, Roberto Di

AU - Michiardi, Pietro

N1 - Generated from Scopus record by KAUST IRTS on 2023-09-20

PY - 2008/12/17

Y1 - 2008/12/17

N2 - In this paper, we sketch a novel gossip-based scheme that allows all the nodes in an n-node overlay network to compute a common aggregate (MAX) of their values using O(n log log n) messages within O(log n) rounds of communication. Our result is achieved relaxing the hypothesis that nodes are address-oblivious, raising the question whether this paradigm (address-aware) is more expressive than the address-oblivious one.

AB - In this paper, we sketch a novel gossip-based scheme that allows all the nodes in an n-node overlay network to compute a common aggregate (MAX) of their values using O(n log log n) messages within O(log n) rounds of communication. Our result is achieved relaxing the hypothesis that nodes are address-oblivious, raising the question whether this paradigm (address-aware) is more expressive than the address-oblivious one.

UR - http://www.scopus.com/inward/record.url?scp=57549095611&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781595939890

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

ER -

Brief announcement: Gossip-based aggregate computation: Computing faster with non address-oblivious schemes

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this