########################################################
########################################################
Authors of original HPCG benchmark: Jack Dongarra and Michael Heroux and Piotr Luszczek
It can be found here: https://github.com/hpcg-benchmark/hpcg
This program is an attempt to port HPCG to Xilinx Alveo U280 accelerator card keeping code relatively close to original one.
To compile this benchmark go to build directory and run either make sw_emu,
make hw_emu or make hw. It will create software emulation, hardware emulation or
haredware version respectively. WARNING: Compiling for hardware takes over 2 hours!
It may be necessary to edit section FPGA specific flags in file build/setup/Make.FPGA
depending on your platform and installation location.
To run benchmark go to build/bin directory and run hpcg-app.
Most of the code designed to run on FPGA board is the file fpga.cpp.
caller.cpp is a file with code needed to prepare buffers, data and kernel.
Original HPCG README below.
HPCG is a software package that performs a fixed number of multigrid preconditioned (using a symmetric Gauss-Seidel smoother) conjugate gradient (PCG) iterations using double precision (64 bit) floating point values.
The HPCG rating is is a weighted GFLOP/s (billion floating operations per second) value that is composed of the operations performed in the PCG iteration phase over the time taken. The overhead time of problem construction and any modifications to improve performance are divided by 500 iterations (the amortization weight) and added to the runtime.
Integer arrays have global and local scope (global indices are unique across the entire distributed memory system, local indices are unique within a memory image). Integer data for global/local indices have three modes:
- 32/32 - global and local integers are 32-bit
- 64/32 - global integers are 64-bit, local are 32-bit
- 64/64 - global and local are 64-bit.
These various modes are required in order to address sufficiently big problems if the range of indexing goes above 2^31 (roughly 2.1B), or to conserve storage costs if the range of indexing is less than 2^31.
The HPCG software package requires the availibility on your system of an implementation of the Message Passing Interface (MPI) if enabling the MPI build of HPCG, and a compiler that supports OpenMP syntax. An implementation compliant with MPI version 1.1 is sufficient.
See the file INSTALL in this directory.
HPCG can be run in just a few minutes from start to finish. However, official runs must be at least 1800 seconds (30 minutes) as reported in the output file. The Quick Path option is an exception for machines that are in production mode prior to broad availability of an optimized version of HPCG 3.0 for a given platform. In this situation (which should be confirmed by sending a note to the HPCG Benchmark owners) the Quick Path option can be invoked by setting the run time parameter equal to 0 (zero).
A valid run must also execute a problem size that is large enough so that data arrays accessed in the CG iteration loop do not fit in the cache of the device in a way that would be unrealistic in a real application setting. Presently this restriction means that the problem size should be large enough to occupy a significant fraction of main memory, at least 1/4 of the total.
Future memory system architectures may require restatement of the specific memory size requirements. But the guiding principle will always be that the problem size should reflect what would be reasonable for a real sparse iterative solver.
The source code documentation can be generated with a Doxygen (version 1.8 or newer). In this directory type:
doxygen tools/hpcg.dox
Doxygen will then generate various output formats in the out directory.
See the file TUNING in this directory.
Known problems and bugs with this release are documented in the file
BUGS.
Check out the website http://www.hpcg-benchmark.org/ for the latest information and performance results.