Intel® Optimized LINPACK Benchmark for Linux OS

This blog entry is taken from Intel(R) Math Kernel Library for the LINUX* OS User's Guide. This document comes when you download and install the Math Kernel Library.

To download, see Intel® Math Kernel Library – LINPACK Download

Intel® Optimized LINPACK Benchmark is a generalization of the LINPACK 1000 benchmark.
It solves a dense (real*8) system of linear equations (Ax=b), measures the amount of
time it takes to factor and solve the system, converts that time into a performance rate, and tests the results for accuracy. The generalization is in the number of equations (N) it can solve, which is not limited to 1000. It uses partial pivoting to assure the accuracy of the results.

Intel is providing optimized versions of the LINPACK benchmarks to make it easier than using HPL for you to obtain high LINPACK benchmark results on your systems based on genuine Intel® processors. Use this package to benchmark your SMP machine.



1. Running the Software
To Run pre-determined sample problem sizes on a give system
# ./runme_xeon32 OR
#./runme_xeon64
To run problem for other problem sizes, you can use and amend liniput_xeon32, and liniputxeon64. However each input file requires the following amount of memory:

• lininput_xeon32 2GB
• lininput_xeon64 16GB

2. Known Limitation

• Intel LINPACK Benchmark is threaded to effectively use multiple processors. In multi-processor systems, best performance will be obtained with Hyper-Threading Technology turned off.
• If an incomplete data input file is given, binaries may either hang or fault