Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki Sirius Huang -- 1267 2022-11-30 01:30:44

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
HandWiki. LINPACK Benchmarks. Encyclopedia. Available online: https://encyclopedia.pub/entry/37858 (accessed on 15 September 2026).
HandWiki. LINPACK Benchmarks. Encyclopedia. Available at: https://encyclopedia.pub/entry/37858. Accessed September 15, 2026.
HandWiki. "LINPACK Benchmarks" Encyclopedia, https://encyclopedia.pub/entry/37858 (accessed September 15, 2026).
HandWiki. (2022, December 02). LINPACK Benchmarks. In Encyclopedia. https://encyclopedia.pub/entry/37858
HandWiki. "LINPACK Benchmarks." Encyclopedia. Web. 02 December, 2022.
LINPACK Benchmarks
Edit

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 latest version of these benchmarks is used to build the TOP500 list, ranking the world's most powerful supercomputers. The aim is to approximate how fast a computer will perform when solving real problems. It is a simplification, since no single computational task can reflect the overall performance of a computer system. Nevertheless, the LINPACK benchmark performance can provide a good correction over the peak performance provided by the manufacturer. The peak performance is the maximal theoretical performance a computer can achieve, calculated as the machine's frequency, in cycles per second, times the number of operations per cycle it can perform. The actual performance will always be lower than the peak performance. The performance of a computer is a complex issue that depends on many interconnected variables. The performance measured by the LINPACK benchmark consists of the number of 64-bit floating-point operations, generally additions and multiplications, a computer can perform per second, also known as FLOPS. However, a computer's performance when running actual applications is likely to be far behind the maximal performance it achieves running the appropriate LINPACK benchmark. The name of these benchmarks comes from the LINPACK package, a collection of algebra Fortran subroutines widely used in the 1980s, and initially tightly linked to the LINPACK benchmark. The LINPACK package has since been replaced by other libraries.

linear equations linpack fortran

References

  1. Dongarra, J.J.; Moler, C.B.; Bunch, J.R.; Stewart, G.W. (1979), LINPACK: users' guide, SIAM, ISBN 9780898711721, https://books.google.com/books?id=AmSm1n3Vw0cC&q=info%3Ahttp%3A%2F%2Fs3da3171290b34600.scholar.google.com%2F0&pg=SL2-PA1 
  2. Dongarra, Jack (1988), "The LINPACK benchmark: An explanation", Supercomputing, Lecture Notes in Computer Science (Springer Berlin/Heidelberg) 297: 456–474, doi:10.1007/3-540-18991-2_27, ISBN 978-3-540-18991-6, http://www.netlib.org/utk/people/JackDongarra/PAPERS/The-LINPACK-Benchmark-An-Explanation.pdf 
  3. Dongarra, Jack J.; Luszczek, Piotr; Petitet, Antoine (2003), "The LINPACK Benchmark: past, present and future", Concurrency and Computation: Practice and Experience (John Wiley & Sons, Ltd.) 15 (9): 803–820, doi:10.1002/cpe.728, http://www.netlib.org/utk/people/JackDongarra/PAPERS/hplpaper.pdf 
  4. High Performance Linpack Benchmark, http://icl.cs.utk.edu/graphics/posters/files/SC2010-HPL.pdf, retrieved 2015-02-10 
  5. Bailey, D.H.; Barszcz, E.; Barton, J.T.; Browning, D.S.; Carter, R.L.; Dagum, L.; Fatoohi, R.A.; Frederickson, P.O. et al. (1991), "The NAS parallel benchmarks summary and preliminary results", Supercomputing (Supercomputing '91. Proceedings of the 1991 ACM/IEEE Conference): 158–165, doi:10.1145/125826.125925, ISBN 0897914597, https://ieeexplore.ieee.org/document/5348941 
  6. "LINPACK FAQ - Can I use Strassen's Method when doing the matrix multiples in the HPL benchmark or for the Top500 run?". http://www.netlib.org/utk/people/JackDongarra/faq-linpack.html#_Can_I_use. Retrieved 2015-02-10. 
  7. "LINPACK FAQ - To what accuracy must be the solution conform?". http://www.netlib.org/utk/people/JackDongarra/faq-linpack.html#_Toc27885722. Retrieved 2015-02-10. 
  8. "The Linpack Benchmark, TOP500 Supercomputing Sites". http://www.top500.org/project/linpack. Retrieved 2015-02-10. 
  9. "Linpack benchmark program in Fortran". http://www.netlib.org/benchmark/linpackd. Retrieved 2015-02-10. 
  10. "Linpack benchmark program in C". http://www.netlib.org/benchmark/linpackc. Retrieved 2015-02-10. 
  11. "Linpack benchmark program in Java". http://www.netlib.org/benchmark/linpackjava. Retrieved 2015-02-10. 
  12. "HPL - A Portable Implementation of the High-Performance Linpack Benchmark for Distributed-Memory Computers". http://www.netlib.org/benchmark/hpl. Retrieved 2015-02-10. 
  13. "HPL algorithm". http://www.netlib.org/benchmark/hpl/algorithm.html. 
  14. "HPL overview". http://icl.cs.utk.edu/hpl/overview/index.html. Retrieved 2015-02-10. 
  15. "An interview with supercomputer legend Jack Dongarra". 2012-05-24. http://www.taborcommunications.com/archives/102765.html. 
  16. Haigh, Thomas (2004). "An interview with Jack J. Dongarra". http://history.siam.org/pdfs2/Dongarra_%20returned_SIAM_copy.pdf. "LINPACK is a benchmark that people often cite because there’s such a historical data base of information there, because it’s fairly easy to run, it’s fairly easy to understand, and it captures in some sense the best and worst of programming." 
  17. Hammond, Steven (1995), Beyond Machoflops: Getting MPPs Into the Production Environment, http://nldr.library.ucar.edu/repository/collections/TECH-NOTE-000-000-000-227 
  18. Gahvari, Hormozd; Hoemmen, Mark; Demmel, James; Yelick, Katherine (2006), "Benchmarking Sparse Matrix-Vector Multiply in Five Minutes", SPEC Benchmark Workshop, http://bebop.cs.berkeley.edu/pubs/gahvari2007-spmvbench-spec.pdf 
  19. Dongarra, Jack J. (2007), "The HPC Challenge Benchmark: A Candidate for Replacing Linpack in the Top500?", SPEC Benchmark Workshop, http://www.spec.org/workshops/2007/austin/slides/Keynote_Jack_Dongarra.pdf 
  20. Christopher Mims (2010-11-08). "Why China's New Supercomputer Is Only Technically the World's Fastest". http://www.technologyreview.com/blog/mimssbits/25981/. Retrieved 2011-09-22. 
  21. Meuer, Martin (2002-05-24). "An interview with supercomputing legend jack dongarra". http://www.taborcommunications.com/archives/102765.html. Retrieved 2015-02-10. 
  22. Luszczek, Piotr; Dongarra, Jack J.; Koester, David; Rabenseifner, Rolf; Lucas, Bob; Kepner, Jeremy; Mccalpin, John; Bailey, David et al. (2005), Introduction to the HPC Challenge Benchmark Suite, http://icl.cs.utk.edu/projectsfiles/hpcc/pubs/hpcc-challenge-benchmark05.pdf 
  23. Hemsoth, Nicole (June 26, 2014). "New HPC Benchmark Delivers Promising Results". HPCWire. http://www.hpcwire.com/2014/06/26/development-pushes-ahead-new-hpc-benchmark/#. Retrieved 2014-09-08. 
  24. Dongarra, Jack J. (2010). "LINPACK Benchmark with Time Limits on Multicore & GPU Based Accelerators". International Supercomputing Conference. http://www.netlib.org/utk/people/JackDongarra/SLIDES/isc-talk-06102.pdf. 
More
Upload a video for this entry
Information
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
View Times: 3.2K
Entry Collection: HandWiki
Revision: 1 time (View History)
Update Date: 02 Dec 2022
Notice
You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
OK
Confirm
Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
Yes
No
${ textCharacter }/${ maxCharacter }
Submit
Cancel
There is no comment~
${ textCharacter }/${ maxCharacter }
Submit
Cancel
${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
Submit
Cancel
Confirm
Are you sure to Delete?
Yes No
Academic Video Service