Skip to main content

Methods for Achieving Peak Computational Rates for Linear Algebra Operations on Superscalar RISC Processors

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1662))

Included in the following conference series:

Abstract

The paper presents methods for developing high performance computational cores and dense linear algebra routines. Different ap- proaches for performing matrix multiplication algorithms are analysed for hierarchical memory computers, taking into account their architec- tural properties and limitations. Block versions of matrix multiplication and LU-decomposition algorithms are described. The performance re- sults of these new algorithms for several processors are compared with the results obtained for optimized LAPACK and BLAS libraries.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Dongarra, D. Walker. The design of linear algebra libraries for high performance computers. LAPACKworking note 58, University ofTennessee, Knoxville, TN, 1993.

    Google Scholar 

  2. S. Carr. Combining optimization for cache and instruction-level parallelism. Proceedings of PACT 96, Boston, MA, 1996.

    Google Scholar 

  3. U. Rüde. Iterative algorithms on high performance architectures. Proceedings / Euro-Par’ 97, Lecture Notes in Computer Science, 1300, 1997, 57–71.

    Chapter  Google Scholar 

  4. O. Bessonov, B. Roux. Optimization techniques and performance analysis for different serial and parallel RISC-based computers. Proceedings / PaCT-97, Lecture Notes in Computer Science, 1277, 1997, 168–174.

    Google Scholar 

  5. J. Dongarra. Performance of various computers using standard linear equations software. CS-89-85, Knoxville, Oak Ridge, TN, 1999.

    Google Scholar 

  6. A. Aho, J. Hopcroft, J. Ullman. The design and analysis of computer algorithms. Addison-Wesley, Reading, 1974.

    MATH  Google Scholar 

  7. J. M. Ortega. Introduction to parallel and vector solution of linear systems. Plenum Press, New York, 1988.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bessonov, O., Fougère, D., Quoc, K.D., Roux, B. (1999). Methods for Achieving Peak Computational Rates for Linear Algebra Operations on Superscalar RISC Processors. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-48387-X_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66363-8

  • Online ISBN: 978-3-540-48387-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics