High Performance Fortran for practical scientific algorithms: An up-to-date evaluation
暂无分享,去创建一个
Abstract A suite of High Performance Fortran (HPF) coding examples of practical scientific algorithms are examined in detail, with the idea that on these simple but non-trivial examples, we can fairly well understand issues related to different data distributions, different parallel constructs, and different programming styles (static versus dynamic allocations). Coding examples include 2D stencils solution of PDEs, N-body problem, LU factorization, several vector/matrix library routines, 2D and 3D array redistribution. Performances of HPF codes are compared to hand-written Fortran codes with message passing libraries. From 1997 to 1998, HPF compilers are improved significantly such that HPF codes perform as well as Fortran+MPI codes for all the examples investigated here. However, many important peculiarities of HPF coding still exist.
[1] Guy L. Steele,et al. The High Performance Fortran Handbook , 1993 .
[2] Chris H. Q. Ding. Evaluations of HPF for Practical Scientific Algorithms on T3E , 1998, HPCN Europe.
[3] Chris H. Q. Ding,et al. A Portable 3D FFT Package for Distributed-Memory Parallel Architectures , 1995, PPSC.
[4] Auke van der Ploeg. Parallelization of a Block Tridiagonal Solver in HPF on an IBM SP2 , 1998, HPCN Europe.
[5] G. C. Fox,et al. Solving Problems on Concurrent Processors , 1988 .