The Benchmarks
As of NPB 3.3, eleven benchmarks are defined as summarized in the following table.
| Benchmark | Name derived from | Available since | Description | Remarks |
|---|---|---|---|---|
| MG | MultiGrid | NPB 1 | Approximate the solution to a three-dimensional discrete Poisson equation using the V-cycle multigrid method | |
| 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 equations | ||
| FT | Fast Fourier Transform | Solve a three-dimensional partial differential equation (PDE) using the fast Fourier transform (FFT) | ||
| IS | Integer Sort | Sort small integers using the bucket sort | ||
| EP | Embarrassingly Parallel | Generate independent Gaussian random variates using the Marsaglia polar method | ||
| BT | Block Tridiagonal | Solve a synthetic system of nonlinear PDEs using three different algorithms involving block tridiagonal, scalar pentadiagonal and symmetric successive over-relaxation (SSOR) solver kernels, respectively |
|
|
| SP | Scalar Pentadiagonal | |||
| LU | Lower-Upper symmetric Gauss-Seidel | |||
| UA | Unstructured Adaptive | NPB 3.1 | Solve Heat equation with convection and diffusion from moving ball. Mesh is adaptive and recomputed at every 5th step. | |
| DC | Data Cube operator | |||
| DT | Data Traffic | NPB 3.2 |
Read more about this topic: NAS Parallel Benchmarks