Skip to Main Content
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.
Cluster Computing, 2004 IEEE International Conference on
Date of Conference: 20-23 Sept. 2004