Notes on LINPACK NxN Benchmark on Hewlett-Packard Systems
Piotr Łuszczek · 2001
Here is the original description of the NxN benchmark [2]: ”[...] The ground rules are as follows: Solve systems of linear equations by some method, allow the size of the problem to vary, and measure the execution time for each size problem. In computing the floating-point execution rate, use 2n/3 + 2n operations independent of the actual method used. (If you choose to do Gaussian Elimination, partial pivoting must be used.) Compute and report a residual for the accuracy of solution as ‖Ax− b‖/(‖A‖‖x‖). The columns in Table 3 are defined as follows: Rmax the performance in Gflop/s for the largest problem run on a machine. Nmax the size of the largest problem run on a machine. N1/2 the size where half the Rmax execution rate is achieved. Rpeak the theoretical peak performance Gflop/s for the machine. [...]”