DPF: A Data Parallel Fortran Benchmark Suite

DSpace/Manakin Repository

DPF: A Data Parallel Fortran Benchmark Suite

Citable link to this page


Title: DPF: A Data Parallel Fortran Benchmark Suite
Author: Hu, Yu; Johnsson, S. Lennart; Kehagias, Dimitris; Shalaby, Nadia

Note: Order does not necessarily reflect citation order of authors.

Citation: Hu, Yu, S. Lennart Johnsson, Dimitris Kehagias, and Nadia Shalaby. 1995. DPF: A Data Parallel Fortran Benchmark Suite. Harvard Computer Science Group Technical Report TR-36-95.
Full Text & Related Files:
Abstract: The Data Parallel Fortran (DPF) benchmark suite is designed for evaluating data parallel compilers and scalable architectures. Many of the DPF codes are provided in three versions: basic, optimized and with library calls for performance critical operations typically found in software libraries. The functionality of the benchmarks cover collective communication functions, 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 intended target language is High Performance Fortran (HPF). However, due to the lack of HPF compilers at the time of this benchmark development, the suite is written in Connection Machine Fortran (CMF). The DPF codes provide performance evaluation metrics in the form of busy and elapsed times (CM-5), FLOP rates and arithmetic efficiency. The codes 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.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:29323487
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search