Sixth IEEE International Conference on Cluster Computing (CLUSTER'04) San Diego, CA, USA September 20-September 23 ISBN: 0-7803-8694-9
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.
Citation:
Dongyoung Kim, Dongseung Kim, "Fast broadcast by the divide-and-conquer algorithm," cluster, pp.487-488, Sixth IEEE International Conference on Cluster Computing (CLUSTER'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||