Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Optimal and near-optimal algorithms for k-item broadcast
Journal of Parallel and Distributed Computing
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion
Discrete Applied Mathematics
MPI: The Complete Reference
Embeddings of Treelike Graphs into 2-Dimensional Meshes
WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
Process cooperation in multiple message broadcast
PVM/MPI'07 Proceedings of the 14th European conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
| Hi-index | 0.04 |
The "fractional tree" algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns -- sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.