By Topic

Vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Seungjo Bae ; Parallel Programming Sect., ETRI, Taejon, South Korea ; Kim, D. ; Ranka, S.

Vector prefix and reduction are collective communication primitives in which all processors must cooperate. The authors present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. The 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

Published in:

Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998

Date of Conference:

30 Mar-3 Apr 1998