العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
EspañolLINPACK
'LINPACK' is a software library for performing numerical linear algebra on digital computers. It was written in Fortran by Jack Dongarra, Jim Bunch, Cleve Moler, and Pete Stewart, and was intended for use on supercomputers in the 1970s and early 1980s. It has been largely superseded by LAPACK, which will run more efficiently on modern architectures.
LINPACK makes use of the BLAS (Basic Linear Algebra Subprograms) libraries for performing basic vector and matrix operations.
The 'LINPACK Benchmarks' are a measure of a system's floating point computing power.
Introduced by Jack Dongarra, they measure how fast a computer solves a dense ''n'' by ''n'' systems of linear equations ''Ax''=''b'', which is a common task in engineering. The solution is obtained by Gaussian elimination with partial pivoting, with 2/3·''n''3 + 2·''n''2 floating point operations. The result is reported in millions of floating point operations per second (Mflop/s).
For large-scale distributed-memory systems, HPL, a portable implementation of the High-Performance LINPACK Benchmark, is used as a performance measure for ranking supercomputers in the TOP500 list of the world's fastest computers. The benchmark is run for different matrix sizes n searching for the size Nmax for which the maximal performance Rmax is obtained. The benchmark also reports the problem size N1/2 where half of the performance (Rmax/2) is achieved.
★ http://www.netlib.org/linpack/
★ http://www.netlib.org/benchmark/hpl/
★ http://www.netlib.org/blas/
★ http://www.top500.org/
★ http://www.netlib.org/benchmark/linpackjava/ a web-based LINPACK benchmark
★ http://www.netlib.org/benchmark/hpl/ The HPL benchmark used in the TOP500
LINPACK makes use of the BLAS (Basic Linear Algebra Subprograms) libraries for performing basic vector and matrix operations.
The 'LINPACK Benchmarks' are a measure of a system's floating point computing power.
Introduced by Jack Dongarra, they measure how fast a computer solves a dense ''n'' by ''n'' systems of linear equations ''Ax''=''b'', which is a common task in engineering. The solution is obtained by Gaussian elimination with partial pivoting, with 2/3·''n''3 + 2·''n''2 floating point operations. The result is reported in millions of floating point operations per second (Mflop/s).
For large-scale distributed-memory systems, HPL, a portable implementation of the High-Performance LINPACK Benchmark, is used as a performance measure for ranking supercomputers in the TOP500 list of the world's fastest computers. The benchmark is run for different matrix sizes n searching for the size Nmax for which the maximal performance Rmax is obtained. The benchmark also reports the problem size N1/2 where half of the performance (Rmax/2) is achieved.
| Contents |
| External links |
External links
★ http://www.netlib.org/linpack/
★ http://www.netlib.org/benchmark/hpl/
★ http://www.netlib.org/blas/
★ http://www.top500.org/
★ http://www.netlib.org/benchmark/linpackjava/ a web-based LINPACK benchmark
★ http://www.netlib.org/benchmark/hpl/ The HPL benchmark used in the TOP500
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves
