A package of FORTRAN programs for numerical linear algebra that is commonly used to create benchmark programs for testing a computer's floating point performance. See benchmark.
Download Computer Desktop Encyclopedia to your iPhone/iTouch
| Computer Desktop Encyclopedia: Linpack |
| 5min Related Video: LINPACK |
| Wikipedia: LINPACK |
| This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. Please improve this article by introducing more precise citations where appropriate. (March 2009) |
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 Gilbert 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 system 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·N3 + 2·N2 floating point operations. The result is reported in millions of floating point operations per second (MFLOP/s, sometimes simply called FLOPS).
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. (There is now also a Green500 list ranking the machines on the TOP500 list based on energy efficiency, in FLOPs per Watt.) The HPC 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.
One of the time-consuming routines in Linpack is SAXPY. Computer architects design systems to optimize SAXPY so as to obtain a higher Linpack score.
|
|
This article's external links may not follow Wikipedia's content policies or guidelines. Please improve this article by removing excessive or inappropriate external links. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
| benchmark (computer jargon) | |
| MFLOPS (informatics) | |
| supercomputer sites (technology) |
| What are linpack result? |
Copyrights:
![]() | Computer Desktop Encyclopedia. THIS COPYRIGHTED DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher. © 1981-2009 Computer Language Company Inc. All rights reserved. Read more | |
![]() | Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "LINPACK". Read more |