Fast broadcast by the divide-and-conquer algorithm

Dongyoung Kim, Dong Seung Kim

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

3 Citations (Scopus)

Abstract

The features of a novel O(m) broadcast algorithm, independent of the number of processors involved, devised by using divided-and-conquer algorithm are discussed. 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. The overall time T(M,K) for the message broadcast of size M on K processors can be computed directly from the algorithm with T(M/2,K/2) and 2t(M/2), where t(M/2) is the point-to-point communication time of the message of size M/2 between arbitrary two processors. It is pointed that the new broadcast algorithm will be much faster if there are many participating processors for the broadcast and the message is large.

Original languageEnglish
Title of host publicationProceedings - IEEE International Conference on Cluster Computing, ICCC
Pages487-488
Number of pages2
DOIs
Publication statusPublished - 2004 Dec 1
Event2004 IEEE International Conference on Cluster Computing, ICCC 2004 - San Diego, CA, United States
Duration: 2004 Sep 202004 Sep 23

Other

Other2004 IEEE International Conference on Cluster Computing, ICCC 2004
CountryUnited States
CitySan Diego, CA
Period04/9/2004/9/23

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Fast broadcast by the divide-and-conquer algorithm'. Together they form a unique fingerprint.

  • Cite this

    Kim, D., & Kim, D. S. (2004). Fast broadcast by the divide-and-conquer algorithm. In Proceedings - IEEE International Conference on Cluster Computing, ICCC (pp. 487-488) https://doi.org/10.1109/CLUSTR.2004.1392653