Sciweavers

Share
IPPS
1998
IEEE

Vector Prefix and Reduction Computation on Coarse-Grained, Distributed-Memory Parallel Machines

12 years 14 days ago
Vector Prefix and Reduction Computation on Coarse-Grained, Distributed-Memory Parallel Machines
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. Our algorithms are relatively architecture independent and can be used effectively in many applications such as Pack/Unpack, Array Prefix/Reduction Functions, and Array Combining Scatter Functions, which are defined in Fortran 90 and in High Performance Fortran. Experimental results on the CM-5 are presented.
Seungjo Bae, Dongmin Kim, Sanjay Ranka
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors Seungjo Bae, Dongmin Kim, Sanjay Ranka
Comments (0)
books