Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
Jack J. Dongarra, Fred G. Gustavson, Alan H. Karp · SIAM Review · 1984
This paper examines common implementations of linear algebra algorithms, such as matrix-vector multiplication, matrix-matrix multiplication and the solution of linear equations. The different versions are examined for efficiency on a computer architecture which uses vector processing and has pipelined instruction execution. By using the advanced architectural features of such machines, one can usually achieve maximum performance, and tremendous improvements in terms of execution speed can be seen over conventional computers.
Cited by 249 works. doi:10.1137/1026003
Authors
References
- Introduction to matrix computations
- LINPACK Users' Guide
- Basic Linear Algebra Subprograms for Fortran Usage
- The CRAY-1 computer system
- The Architecture of Pipelined Computers
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- Some Basic Techniques for Solving Sparse Systems of Linear Equations
- Experience of sparse matrix codes on the CRAY-1
- Matrix computations with Fortran and paging
- Solving Large Full Sets of Linear Equations in a Paged Virtual Store