Title: A novel distributed algorithm for high-throughput and scalable gossiping
Authors: De Florio, Vincenzo ×
Deconinck, Geert
Lauwereins, Rudy #
Issue Date: May-2000
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:1823 pages:313-322
Conference: HPCN Europe 2000 edition:8 location:Amsterdam, The Netherlands date:May 2000
Abstract: A family of gossiping algorithms depending on a combinatorial parameter is introduced, formalized, and discussed. Three members are analyzed. It is shown that, depending on the pattern of the parameter, gossiping can use from O(N-2) to O(N) time, N being the number of communicating members. The last and best-performing algorithm, whose activity follows the execution pattern of pipelined hardware processors, is shown to exhibit high throughput and efficiency that are constant with respect to N. This translates in unlimited scalability for the corresponding gossiping service provided by this algorithm.
Description: Proceedings of 8th International Conference on High Performance Computing and Networking Europe (HPCN Europe 2000); Lecture Notes in Computer Science (Ed. M. Bubak, H. Afsarmanesh, R. Williams, B. Hertzberger), Springer-Verlag
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:ESAT - ELECTA, Electrical Energy Computer Architectures
Associated Section of ESAT - INSYS, Integrated Systems
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science