552.pep
SPEC ACCEL Benchmark Description File

Benchmark Name

552.pep

Benchmark Author

Serial C version was developed the Center for Manycore Programming at Seoul National University and derived from the serial Fortran versions in "NPB3.3-SER" developed by NAS.

Initial port to OpenMP by Alexander Grund

Benchmark Program General Category

Embarrassingly Parallel

Benchmark Description

EP kernel benchmark is an embarrassingly parallel algorithm with a reduction. The algorithm generates n pairs of uniform (0,1) pseudorandom deviates (xj,yj). Then for each j the condition tj = x2j + yj2 <= 1 is checked. If the condition is satisfied, Xk = xj sqrt(-2log(tj))/tj and Yk = yj sqrt(-2log(tj))/tj , where k starts from 1 and increments after each step. Finally Ql (0 <= l <= 9) counts the pairs (Xk,Yk) that lie in the square annulus l <= max(|Xk, Yk|) <= l + 1. Then Sum(Xk) + Sum(Yk) are then calculated. In this algorithm, Ql(0 <= l <= 9) performs the reduction of all the pairs.

Input Description

The input dataset size is comprised of W, A through E classes. We have used the 3 classes in our experiments:

Class W: reference data for n = 2^25 pairs of (xj,yj) (1 <= j <= n)

Class C: reference data for n = 2^32 pairs of (xj,yj) (1 <= j <= n)

Class D: references data for n = 2^36 pairs of (xj,yj) (1 <= j <= n)

Class W is used by the test workload, Class C by train, and Class D by ref.

Output Description

Ql (0 <= l <= 9) that counts the pairs (Xk,Yk) that lie in the square annulus l <= max(|Xk, Yk|) <= l + 1, and Sum(Xk) + Sum(Yk).

Programming Language

C

Threading Model

OpenMP

Known portability issues

None.

Reference

1. Information on NPB 3.3, including the technical report, the original specifications, source code, results and information on how to submit new results, is available at: http://www.nas.nasa.gov/Software/NPB/
2. Information about the C version developed by the Center for Manycore Programming can be found at: http://aces.snu.ac.kr/Center_for_Manycore_Programming/Home.html