HPGMG is an HPC benchmarking effort and supercomputing ranking metric based on geometric multigrid methods.

Design Principles

Community-driven
Our development process is completely open, empowering the community to guide the design tradeoffs in the benchmark.
Accurate and "ungameable"
High performance on HPGMG should be sufficient for high performance on most HPC applications. Any hardware characteristic promoted by HPGMG should be necessary for at least one major HPC application. We adopt a data-driven approach to quantify this.
Long-term durability
The benchmark should remain relevant indefinitely. Full MG efficiency has been unrivaled for 40 years and is representative of FMM, FFT, AMG, etc. We believe it will become increasingly relevant as more applications can no longer afford to use sub-optimal algorithms.
Scale-free specification
The benchmark specification fixes no intermediate scales between the global problem and individual elements. This reduces the number of rules governing valid implmentations on new architectures.
Scale-free communication
The specification involves data dependencies at all scales (not just "nearest neighbor"). A multigrid communication graph has bounded degree and logarithmic diameter.

Implementations

Finite Element
compute- and cache-intensive, vectorizes
Finite Volume
memory bandwidth-intensive, boundary condition choice

Get involved

HPGMG repository
Get the code: git clone https://bitbucket.org/hpgmg/hpgmg
Open an issue to ask questions, make suggestions, etc.

Posts