Design and Implementation of the HPC Challenge Benchmark

Design and Implementation of the HPC Challenge
∗Benchmark Suite
1 1,2 3Piotr Luszczek , Jack J. Dongarra , and Jeremy Kepner
1UniversityofTennesseeKnoxville
2OakRidgeNationalLaboratory
3MITLincolnLab
September19,2006
Abstract
The HPC Challenge (HPCC) benchmark suite has been
released by the DARPA HPCS program to help define PTRANS HPL
the performance boundaries of future Petascale comput
STREAM DGEMM
ing systems. HPCC is a suite of tests that examine the
performance of high end architectures using kernels with
memory access patterns more challenging than those of CFD Radarcross section
the High Performance Linpack (HPL) benchmark used in
the TOP500 list. Thus, the suite is designed to augment
Applications
the T list, providing benchmarks that bound the
performance of many real applications as a function of
memory access characteristics e.g., spatial and temporal
locality, and providing a framework for including addi TSP RSA DSP
tionaltests. Inparticular,thesuiteiscomposedofseveral
well known computational kernels that attempt to span
RandomAccess FFT
high and low spatial and temporal locality space. By de
sign,theHPCCtestsarescalablewiththesizeofdatasets 0 Temporallocality
being a function of the largest HPL matrix for the tested
Figure1: TheapplicationareastargetedbytheHPCSPro system.
gram are bound by the HPCC tests in the memory access
localityspace.
∗This work was supported in part by the DARPA, NSF, and DOE
throughtheDARPAHPCSprogramundergrantFA8750 04 1 ...