HPFBench: a high performance Fortran benchmark suite

The High Performance Fortran (HPF) benchmark suite HPFBench is designed for evaluating the HPF language and compilers on scalable architectures. The functionality of the benchmarks covers scientific software library functions and application kernels that reflect the computational structure and commu...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on mathematical software 2000-03, Vol.26 (1), p.99-149
Main Authors: HU, Y. CHARLIE, JIN, GUOHUA, JOHNSSON, S. LENNART, KEHAGIAS, DIMITRIS, SHALABY, NADIA
Format: Article
Language:English
Subjects:
algorithm
benchmarks
communication
compilers
Evaluation
FORTRAN
High Performance Fortran
languages
Mathematical research
Mathematical software
measurement
parts
projections
stability
summation
supercomputers
systems
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The High Performance Fortran (HPF) benchmark suite HPFBench is designed for evaluating the HPF language and compilers on scalable architectures. The functionality of the benchmarks covers scientific software library functions and application kernels that reflect the computational structure and communication patterns in fluid dynamic simulations, fundamental physics, and molecular studies in chemistry and biology. The benchmarks are characterized in terms of FLOP count, memory usage, communication pattern, local memory accesses, array allocation mechanism, as well as operation and communication counts per iteration. The benchmarks output performance evaluation metrics in the form of elapsed times, FLOP rates, and communication time breakdowns. We also provide a benchmark guide to aid the choice of subsets of the benchmarks for evaluating particular aspects of an HPF compiler. Furthermore, we report an evaluation of an industry-leading HPF compiler from the Portland Group Inc. using the HPFBench benchmarks on the distributed-memory IBM SP2.
ISSN:0098-3500
1557-7295
1557-7295
DOI:10.1145/347837.347872