An Evaluation of High Performance Fortran Compilers Using the HPFBench Benchmark Suite

The High Performance Fortran (HPF) benchmark suite HPF-Bench was designed for evaluating the HPF language and compilers on scalable architectures. The functionality of the benchmarks covers scientific software library functions and application kernels. In this paper, we report on an evaluation of two commercial HPF compilers, namely, xlhpf from IBM and pghpf from PGI, on an IBM SP2 using the linear algebra subset of the HPFBench benchmarks.Our evaluation shows that, on a single processor, there is a signicant overhead for the codes compiled under the two HPF compilers and their Fortran 90 companions, compared with the sequential versions of the codes compiled using xlf. The difference mainly comes from the difference in code segments corresponding to the communications when running in parallel. When running in parallel, codes compiled under pghpf achieve from slightly to signicantly better speedups than when compiled under xlhpf. The difference is mainly from better performance of communications such as cshift, spread, sum and gather/scatter under pghpf.

[1]  Åke Björck,et al.  Numerical Methods , 2020, Markov Renewal and Piecewise Deterministic Processes.

[2]  Martin Charles Golumbic,et al.  Instruction Scheduling Across Control Flow , 1993, Sci. Program..

[3]  Geoffrey C. Fox,et al.  The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers , 1989, Int. J. High Perform. Comput. Appl..

[4]  Report,et al.  Public International Benchmarks for Parallel Computers , 1993 .

[5]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[6]  Rice UniversityCORPORATE,et al.  High performance Fortran language specification , 1993 .

[7]  David H. Bailey,et al.  The Nas Parallel Benchmarks , 1991, Int. J. High Perform. Comput. Appl..

[8]  James Demmel,et al.  ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers - Design Issues and Performance , 1995, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[9]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[10]  James Demmel,et al.  ScaLAPACK: A Linear Algebra Library for Message-Passing Computers , 1997, PPSC.

[11]  Gene H. Golub,et al.  Matrix computations , 1983 .

[12]  A. Booth.  Numerical Methods , 1957, Nature.

[13]  S. Lennart Johnsson,et al.  Matrix multiplication on the connection machine , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[14]  Shang-Hua Teng,et al.  High performance Fortran for highly irregular problems , 1997, PPOPP '97.