Topological Properties of Hypercubes
IEEE Transactions on Computers
What have we learnt from using real parallel machines to solve real problems?
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Implementation of parallel numerical routines using broadcast communication schemes
CONPAR 90 Proceedings of the joint international conference on Vector and parallel processing
Data-parallel programming on MIMD computers
Data-parallel programming on MIMD computers
Designing broadcasting algorithms in the postal model for message-passing systems
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Parallel programming in Split-C
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
Pipelining Broadcasts on Heterogeneous Platforms
IEEE Transactions on Parallel and Distributed Systems
Scheduling for atomic broadcast operation in heterogeneous networks with one port model
The Journal of Supercomputing
| Hi-index | 0.00 |
One-to-all broadcast is frequently implemented on multicomputers using a binomial tree communication pattern. The source processor, at the root of the broadcast tree, completes the broadcast before the processors at the leaves of the tree. This imbalance can degrade performance when a data-parallel algorithm requires a series of broadcasts from different source processors. In this paper, we show that using a reflected Gray code to order broadcasts minimizes the communication time.