The LINPACK Benchmark: An explanation

  • Jack J. Dongarra
Session 5: Parallel Processing II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 297)


Peak Performance Vector Operation Full Precision Benchmark Report Basic Linear Algebra Subprogram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D.W. Barron and H.P.F. Swinnerton-Dyer, “Solution of Simultaneous Linear Equations Using a Magnetic-Tape Store,” Computer J., vol. 3, pp. 28–33, 1960.Google Scholar
  2. 2.
    M. Berry, K. Gallivan, W. Harrod, W. Jalby, S. Lo, U. Meier, B. Philippe, and A. Sameh, “Parallel Algorithms on the CEDAR System,” CSRD Report No. 581, 1986.Google Scholar
  3. 3.
    C. Bischof and C. Van Loan, “The WY Representation for Products of Householder Matrices,” SIAM SISSC, vol. 8, 2, March, 1987.Google Scholar
  4. 4.
    I. Bucher and T. Jordan, “Linear Algebra Programs for use on a Vector Computer with a Secondary Solid State Storage Device,” in Advances in Computer Methods for Partical Differential Equations, ed. R. Vichnevetsky and R Stepleman, pp. 546–550, IMACS, 1984.Google Scholar
  5. 5.
    D.A. Calahan, “Block-Oriented Local-Memory-Based Linear Equation Solution on the CRAY-2: Uniprocessor Algorithms,” Proceedings International Conference on Parallel Processing, pp. 375–378, IEEE Computer Society Press, August 1986.Google Scholar
  6. 6.
    B. Chartres, “Adaption of the Jacobi and Givens Methods for a Computer with Magnetic Tape Backup Store,” University of Sydney Technical Report No. 8, 1960.Google Scholar
  7. 7.
    A.K. Dave and I.S. Duff, “Sparse Matrix Calculations on the CRAY-2,” AERE Harwell Report CSS 197 (to appear Parallel Computing), 1986.Google Scholar
  8. 8.
    J.J. Dongarra, “Performance of Various Computers Using Standard Linear Equations Software in a Fortran Environment,” Argonne National Laboratory MCS-TM-23, April, 1987.Google Scholar
  9. 9.
    J.J. Dongarra, J. Bunch, C. Moler, and G. Stewart, LINPACK Users' Guide, SIAM Pub., Philadelphia, 1976.Google Scholar
  10. 10.
    J.J. Dongarra, J. DuCroz, I. Duff, and S. Hammarling, “A Proposal for a Set of Level 3 Basic Linear Algebra Subprograms,” Argonne National Laboratory Report, ANL-MCS-TM-88, April 1987.Google Scholar
  11. 11.
    J.J. Dongarra, J. DuCroz, S. Hammarling, and R. Hanson, “An Extended Set of Fortran Basic Linear Algebra Subprograms,” Argonne National Laboratory Report, ANL-MCS-TM-41 (Revision 3), November 1986.Google Scholar
  12. 12.
    J.J. Dongarra, J. DuCroz, S. Hammarling, and R. Hanson, “An Extended Set of Basic Linear Algebra Subprograms: Model Implementation and Test Programs,” Argonne National Laboratory Report, ANL-MCS-TM-81, November, 1986.Google Scholar
  13. 13.
    J.J. Dongarra and I.S. Duff, “Advanced Architecture Computers,” Argonne National Laboratory Report, ANL-MCS-TM-57 (Revision 1), January, 1987.Google Scholar
  14. 14.
    J.J. Dongarra and S. C. Eisenstat, “Squeezing the Most out of an Algorithm in Cray Fortran,” ACM Trans. Math. Software, vol. 10, 3, pp. 221–230, 1984.Google Scholar
  15. 15.
    J.J. Dongarra, F. Gustavson, and A. Karp, “Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine,” SIAM Review, vol. 26, 1, pp. 91–112, Jan. 1984.Google Scholar
  16. 16.
    J.J. Dongarra and T. Hewitt, “Implementing Dense Linear Algebra Algorithms Using Multitasking on the CRAY X-MP-4,” SIAM J. Sci Stat. Comp., vol. 7, 1, pp. 347–350, January, 1986.Google Scholar
  17. 17.
    J.J. Dongarra and A. Hinds, “Unrolling Loops in Fortran,” Software-Practice and Experience, vol. 9, pp. 219–226, 1979.Google Scholar
  18. 18.
    J.J. Dongarra and D.C. Sorensen, “Linear Algebra on High-Performance Computers,” in Proceedings Parallel Computing 85, ed. U. Schendel, pp. 3–32, North Holland, 1986.Google Scholar
  19. 19.
    J. DuCroz, S. Nugent, J. Reid, and D. Taylor, “Solving Large Full Sets of Linear Equations in a Paged Virtual Store,” TOMS, vol. 7,4, pp. 527–536, 1981.Google Scholar
  20. 20.
    I.S. Duff, “Full Matrix Techniques in Sparse Gaussian Elimination,” Numerical Analysis Proceedings, Dundee 1981, Lecture Notes in Mathematics 912, pp. 71–84, Springer-Verlag, Berlin, 1981.Google Scholar
  21. 21.
    A. George and H. Rashwan, “Auxiliary Storage Methods for Solving Finite Element Systems,” SIAM SISSC, vol. 6, pp. 882–910, 1985.Google Scholar
  22. 22.
    R.W. Hockney and C.R. Jesshope, Parallel Computers, p. Adam Hilger Ltd, Bristol, 1981.Google Scholar
  23. 23.
    IBM, “Engineering and Scientific Subroutine Library,” IBM, vol. Program Number: 5668-863, 1986.Google Scholar
  24. 24.
    D. Knuth, “An Empirical Study of Fortran Programs,” Software-Practice and Experience, vol. 1, pp. 105–133, 1971.Google Scholar
  25. 25.
    C. Lawson, R. Hanson, D. Kincaid, and F. Krogh, “Basic Linear Algebra Subprograms for Fortran Usage,” ACM Transactions on Mathematical Software, vol. 5, pp. 308–323, 1979.Google Scholar
  26. 26.
    A.C. McKellar and E.G. Coffman Jr., “Organizing Matrices and Matrix Operations for Paged Memory Systems,” CACM, vol. 12,3, pp. 153–165, 1969.Google Scholar
  27. 27.
    D. Pager, “Some Notes on Speeding Up Certain Loops by Software, Firmware, and Hardware Means,” IEEE Trans. on Comp., pp. 97–100, January 1972.Google Scholar
  28. 28.
    Y. Robert and P. Sguazzero, “The LU Decomposition Algorithm and Its Efficient Fortran Implementation on the IBM 3090 Vector Multiprocessor,” IBM ECSEC Report ICE-0006, March 1987.Google Scholar
  29. 29.
    R. Schreiber, “Engineering and Scientific Subroutine Library, Module Design Specification,” SAXPY Computer Corporation, 255 San Geronimo Way, Sunnyvale, CA 94086, vol. 1, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Jack J. Dongarra
    • 1
  1. 1.Argonne National LaboratoryMathematics and Computer Science DivisionArgonne

Personalised recommendations