Runtime array redistribution in HPF programs
Open Access
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Describes efficient algorithms for runtime array redistribution in High Performance Fortran (HPF) programs. We consider block(m)-to-cyclic, cyclic-to-block(m) and the general cyclic(x)-to-cyclic(y) type redistributions. We initially describe algorithms for one-dimensional arrays and then extend the methodology to multidimensional arrays. The algorithms are practical enough to be easily implemented in the runtime library of an HPF compiler and can also be directly used in application programs requiring redistribution. Performance results on the Intel Paragon are discussed.Keywords
This publication has 4 references indexed in Scilit:
- Scheduling regular and irregular communication patterns on the CM-5Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- All-to-all communication on meshes with wormhole routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient Compilation of Array Statements for Private Memory MulticomputersPublished by Defense Technical Information Center (DTIC) ,1993
- Fortran 90D/HPF compiler for distributed memory MIMD computersPublished by Association for Computing Machinery (ACM) ,1993