High Performance Linpack FOR LINUX

High Performance Linpack (HPL) is a software package that solves a (random) dense linear system in double precision (64 bits) arithmetic on distributed-memory computers. It can thus be regarded as a portable as well as freely available implementation of the High Performance Computing Linpack Benchmark.

Key Features:

• Two-dimensional block-cyclic data distribution


• Right-looking variant of the LU factorization with row partial pivoting featuring multiple look-ahead depths


• Recursive panel factorization with pivot search and column broadcast combined


• Various virtual panel broadcast topologies


• Bandwidth reducing swap-broadcast algorithm


• Backward substitution with look-ahead of depth 1

Testing and Timing Program:

The HPL package provides a testing and timing program to quantify the accuracy of the obtained solution as well as the time it took to compute it. The best performance achievable by this software on your system depends on a large variety of factors.

Scalability:

With some restrictive assumptions on the interconnection network, the algorithm described here and its attached implementation are scalable in the sense that their parallel efficiency is maintained constant with respect to the per processor memory usage.

System Requirements:

• An implementation of the Message Passing Interface MPI (1.1 compliant)


• An implementation of either the Basic Linear Algebra Subprograms BLAS or the Vector Signal Image Processing Library VSIPL


• Machine-specific as well as generic implementations of MPI, the BLAS, and VSIPL

Acknowledgements:

This work was supported in part by a grant from the Department of Energy's Lawrence Livermore National Laboratory and Los Alamos National Laboratory as part of the ASCI Projects contract numbers B503962 and 12187-001-00 4R.