An approach to massively distributed aggregate computing on peer-to-peer networks

M. Jelasity, Wojtek Kowalczyk, Maarten Van Steen

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

13 Citations (Scopus)

Abstract

The emergence of the Internet as a computing platform increases the demand for new classes of algorithms that combine massive distributed processing and complete decentralization. Moreover, these algorithms should be able to execute in an environment that is heterogeneous, changes almost continuously, and consists of millions of nodes. An important class of algorithms that can play an important role in such environments is aggregate computing: computing the aggregation of attributes such as extremal values, mean, and variance. These algorithms typically find their application in distributed data mining and systems management. We present novel, massively scalable and fully decentralized algorithms for computing aggregates, and substantiate our scalability claims through simulations and theoretical analysis.

Original languageEnglish
Title of host publicationProceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding
Pages200-207
Number of pages8
DOIs
Publication statusPublished - 2004
EventProceedings - 12th Euromicro Conference on Parallel, Distributed and Network-based Proceedings, PDP 2004 - A Coruna, Spain
Duration: Feb 11 2004Feb 13 2004

Other

OtherProceedings - 12th Euromicro Conference on Parallel, Distributed and Network-based Proceedings, PDP 2004
CountrySpain
CityA Coruna
Period2/11/042/13/04

Fingerprint

Peer to peer networks
Data mining
Scalability
Agglomeration
Internet
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Jelasity, M., Kowalczyk, W., & Van Steen, M. (2004). An approach to massively distributed aggregate computing on peer-to-peer networks. In Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding (pp. 200-207) https://doi.org/10.1109/EMPDP.2004.1271446

An approach to massively distributed aggregate computing on peer-to-peer networks. / Jelasity, M.; Kowalczyk, Wojtek; Van Steen, Maarten.

Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding. 2004. p. 200-207.

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

Jelasity, M, Kowalczyk, W & Van Steen, M 2004, An approach to massively distributed aggregate computing on peer-to-peer networks. in Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding. pp. 200-207, Proceedings - 12th Euromicro Conference on Parallel, Distributed and Network-based Proceedings, PDP 2004, A Coruna, Spain, 2/11/04. https://doi.org/10.1109/EMPDP.2004.1271446
Jelasity M, Kowalczyk W, Van Steen M. An approach to massively distributed aggregate computing on peer-to-peer networks. In Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding. 2004. p. 200-207 https://doi.org/10.1109/EMPDP.2004.1271446
Jelasity, M. ; Kowalczyk, Wojtek ; Van Steen, Maarten. / An approach to massively distributed aggregate computing on peer-to-peer networks. Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding. 2004. pp. 200-207
@inproceedings{71ece0b73aa643e99d99fa1b5a1fa735,
title = "An approach to massively distributed aggregate computing on peer-to-peer networks",
abstract = "The emergence of the Internet as a computing platform increases the demand for new classes of algorithms that combine massive distributed processing and complete decentralization. Moreover, these algorithms should be able to execute in an environment that is heterogeneous, changes almost continuously, and consists of millions of nodes. An important class of algorithms that can play an important role in such environments is aggregate computing: computing the aggregation of attributes such as extremal values, mean, and variance. These algorithms typically find their application in distributed data mining and systems management. We present novel, massively scalable and fully decentralized algorithms for computing aggregates, and substantiate our scalability claims through simulations and theoretical analysis.",
author = "M. Jelasity and Wojtek Kowalczyk and {Van Steen}, Maarten",
year = "2004",
doi = "10.1109/EMPDP.2004.1271446",
language = "English",
isbn = "0769520839",
pages = "200--207",
booktitle = "Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding",

}

TY - GEN

T1 - An approach to massively distributed aggregate computing on peer-to-peer networks

AU - Jelasity, M.

AU - Kowalczyk, Wojtek

AU - Van Steen, Maarten

PY - 2004

Y1 - 2004

N2 - The emergence of the Internet as a computing platform increases the demand for new classes of algorithms that combine massive distributed processing and complete decentralization. Moreover, these algorithms should be able to execute in an environment that is heterogeneous, changes almost continuously, and consists of millions of nodes. An important class of algorithms that can play an important role in such environments is aggregate computing: computing the aggregation of attributes such as extremal values, mean, and variance. These algorithms typically find their application in distributed data mining and systems management. We present novel, massively scalable and fully decentralized algorithms for computing aggregates, and substantiate our scalability claims through simulations and theoretical analysis.

AB - The emergence of the Internet as a computing platform increases the demand for new classes of algorithms that combine massive distributed processing and complete decentralization. Moreover, these algorithms should be able to execute in an environment that is heterogeneous, changes almost continuously, and consists of millions of nodes. An important class of algorithms that can play an important role in such environments is aggregate computing: computing the aggregation of attributes such as extremal values, mean, and variance. These algorithms typically find their application in distributed data mining and systems management. We present novel, massively scalable and fully decentralized algorithms for computing aggregates, and substantiate our scalability claims through simulations and theoretical analysis.

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

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

U2 - 10.1109/EMPDP.2004.1271446

DO - 10.1109/EMPDP.2004.1271446

M3 - Conference contribution

AN - SCOPUS:3042528543

SN - 0769520839

SN - 9780769520834

SP - 200

EP - 207

BT - Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding

ER -