Using a set of benchmarks described below, different optimization options for the different compilers on Edison. The compilers are also compared against one another on the benchmarks.
We used these benchmarks from the NERSC6 procurement:
|GTC||Fusion||PIC, finite difference||2048||f90|
|IMPACT-T||Accelerator Physics||PIC, FFT||1024||f90|
|MILC||Materials Science||Conjugate gradient, sparse matrix, FFT||1024||c, assembly|
NPB 3.3.1 MPI Parallel Benchmarks
The following NPB 3.3 MPI Benchmarks were run, all at a concurrency of 1024 processes. They are all written in Fortran.
|BT||Block Tridiagonal||Solve a synthetic system of nonlinear PDEs using a block tridiagonal algorithm||E|
|CG||Conjugate Gradient||Estimate the smallest eigenvalue of a large sparse symmetric positive-definite matrix using the inverse iteration with the conjugate gradient method as a subroutine for solving systems of linear equation||E|
|EP||Embarassingly Parallel||Generate independent Gaussian random variates using the Marsaglia polar method||E|
|FT||Fast Fourier Transform||Solve a three-dimensional PDE using FFT||E|
|LU||Lower-Upper Symmetric Gauss-Seidel||Solve a synthetic system of nonlinear PDEs using a symmetric successive over-relaxation algorithm||E|
|MG||MultiGrid||Approximate the solution to a three-dimensional discrete Poisson equation using the V-cycle multigrid method||E|
|SP||Scalar Pentadiagona||Solve a synthetic system of nonlinear PDEs using a scalar pentadiagonal algorithm||E|