Two-tree algorithms for full bandwidth broadcast, reduction and scan
Authors:
- Peter SandersPSPeter Sanders
- Jochen SpeckJSJochen Speck
- Jesper Larsson TräffJTJesper Larsson Träff
- 1 December 2009
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 35 (12) , 581-594
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Performance analysis of MPI collective operationsCluster Computing, 2007
- Collective operations in NEC's high-performance MPI libraries2006
- Optimal multiple message broadcasting in telephone-like communication systemsDiscrete Applied Mathematics, 2000
- A high-performance, portable implementation of the MPI message passing interface standardParallel Computing, 1996
- Multiple message broadcasting in communication networksNetworks, 1995
- Broadcasting multiple messages in simultaneous send/receive systemsDiscrete Applied Mathematics, 1994
- Building a high-performance collective communication libraryProceedings of the 1994 ACM/IEEE conference on Supercomputing - Supercomputing '94, 1994
- Pipelined Parallel Prefix Computations, and Sorting on a Pipelined HypercubeJournal of Parallel and Distributed Computing, 1993
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Data parallel algorithmsCommunications of the ACM, 1986