Redistribution of block-cyclic data distributions using MPI
- Oak Ridge National Lab., TN (United States)
- Oregon Graduate Inst., Beaverton, OR (United States). Dept. of Computer Science and Engineering
Arrays that are distributed in a block cyclic fashion are important for many applications in the computational sciences since they often lead to parallel algorithms with good load balancing properties. We consider the problem of redistributing such an array to a new block size. This operation is directly expressible in High Performance Fortran (HPF) and will arise in applications written in this language. Efficient message passing algorithms are given for the redistribution operation, expressed in the standardized message passing interface, MPI. The algorithms are analyzed and performance results from the IBM SP-1 and Intel Paragon are given and discussed. The results show that redistribution can be done in time comparable to other collective communication operations, such as broadcast and MPI{underscore}ALLTOALL.
- Research Organization:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- Department of the Army, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 106487
- Report Number(s):
- ORNL/TM-12999; ON: DE95017191; CNN: DAAL03-91-C-0047; ASC-ASC-9005933
- Resource Relation:
- Other Information: PBD: Jun 1995
- Country of Publication:
- United States
- Language:
- English
Similar Records
Global Arrays Parallel Programming Toolkit
Split-C and active messages under SUNMOS on the Intel Paragon