Fast broadcast by the divide-and-conquer algorithm

Authors:
Dongyoung Kim;Dongseung Kim
Affiliations:
Dept. of Electr. Eng., Korea Univ., Seoul, South Korea;Dept. of Electr. Eng., Korea Univ., Seoul, South Korea
Venue:
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
Year:
2004

Citing 0
Cited 2

Design of fast collective communication functions on clustered workstations with ethernet and myrinet

ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
Load balanced block lanczos algorithm over GF(2) for factorization of large keys

HiPC'06 Proceedings of the 13th international conference on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Collective communication functions including the broadcast in cluster computers usually take O(m log P) time in propagating the size-m message to P processors. We have devised a new O(m) broadcast algorithm, independent of the number of processors involved, by using divided-and-conquer algorithm. Details are given below.