Optimal broadcast for fully connected processor-node networks
JL Träff, A Ripke - Journal of Parallel and Distributed Computing, 2008 - Elsevier
We develop and implement an optimal broadcast algorithm for fully connected processor
networks under a bidirectional communication model in which each processor can
simultaneously send a message to one processor and receive a message from another,
possibly different processor. For any number of processors p the algorithm requires N− 1+⌈
logp⌉ communication rounds to broadcast N blocks of data from a root processor to the
remaining processors, meeting the lower bound in the model. For data of size m, assuming …
networks under a bidirectional communication model in which each processor can
simultaneously send a message to one processor and receive a message from another,
possibly different processor. For any number of processors p the algorithm requires N− 1+⌈
logp⌉ communication rounds to broadcast N blocks of data from a root processor to the
remaining processors, meeting the lower bound in the model. For data of size m, assuming …
Showing the best result for this search. See all results