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

Márk Jelasity, Wojtek Kowalczyk, Maarten van Steen

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

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 publication12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004
Subtitle of host publicationProceedings
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages200-207
Number of pages8
ISBN (Print)9780769520834
DOIs
Publication statusPublished - 12 Jul 2004
Externally publishedYes
Event12th Euromicro Conference on Parallel, Distributed and Network-based Proceedings, PDP 2004 - A Coruña Spanje, Spain
Duration: 11 Feb 200413 Feb 2004
Conference number: 12

Publication series

NameEuromicro Conference on Parallel, Distributed and Network-Based Processing
PublisherIEEE
Volume2004
ISSN (Print)1066-6192

Conference

Conference12th Euromicro Conference on Parallel, Distributed and Network-based Proceedings, PDP 2004
Abbreviated titlePDP
CountrySpain
CityA Coruña Spanje
Period11/02/0413/02/04

Fingerprint

Peer to peer networks
Data mining
Scalability
Agglomeration
Internet
Processing

Cite this

Jelasity, M., Kowalczyk, W., & van Steen, M. (2004). An approach to massively distributed aggregate computing on peer-to-peer networks. In 12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004: Proceedings (pp. 200-207). (Euromicro Conference on Parallel, Distributed and Network-Based Processing; Vol. 2004). Piscataway, NJ: IEEE. https://doi.org/10.1109/EMPDP.2004.1271446
Jelasity, Márk ; Kowalczyk, Wojtek ; van Steen, Maarten. / An approach to massively distributed aggregate computing on peer-to-peer networks. 12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004: Proceedings. Piscataway, NJ : IEEE, 2004. pp. 200-207 (Euromicro Conference on Parallel, Distributed and Network-Based Processing).
@inproceedings{9b4c2d973e8447f697b4904f105142d2,
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{\'a}rk Jelasity and Wojtek Kowalczyk and {van Steen}, Maarten",
year = "2004",
month = "7",
day = "12",
doi = "10.1109/EMPDP.2004.1271446",
language = "English",
isbn = "9780769520834",
series = "Euromicro Conference on Parallel, Distributed and Network-Based Processing",
publisher = "IEEE",
pages = "200--207",
booktitle = "12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004",
address = "United States",

}

Jelasity, M, Kowalczyk, W & van Steen, M 2004, An approach to massively distributed aggregate computing on peer-to-peer networks. in 12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004: Proceedings. Euromicro Conference on Parallel, Distributed and Network-Based Processing, vol. 2004, IEEE, Piscataway, NJ, pp. 200-207, 12th Euromicro Conference on Parallel, Distributed and Network-based Proceedings, PDP 2004, A Coruña Spanje, Spain, 11/02/04. https://doi.org/10.1109/EMPDP.2004.1271446

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

12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004: Proceedings. Piscataway, NJ : IEEE, 2004. p. 200-207 (Euromicro Conference on Parallel, Distributed and Network-Based Processing; Vol. 2004).

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

TY - GEN

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

AU - Jelasity, Márk

AU - Kowalczyk, Wojtek

AU - van Steen, Maarten

PY - 2004/7/12

Y1 - 2004/7/12

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

U2 - 10.1109/EMPDP.2004.1271446

DO - 10.1109/EMPDP.2004.1271446

M3 - Conference contribution

SN - 9780769520834

T3 - Euromicro Conference on Parallel, Distributed and Network-Based Processing

SP - 200

EP - 207

BT - 12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004

PB - IEEE

CY - Piscataway, NJ

ER -

Jelasity M, Kowalczyk W, van Steen M. An approach to massively distributed aggregate computing on peer-to-peer networks. In 12th Euromicro Conference on Parallel, Distributed and Network-based, PDP 2004: Proceedings. Piscataway, NJ: IEEE. 2004. p. 200-207. (Euromicro Conference on Parallel, Distributed and Network-Based Processing). https://doi.org/10.1109/EMPDP.2004.1271446