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

Authors:
Oleg Bessonov;Dominique Fougère;Ky Dang Quoc;Bernard Roux
Affiliations:
-;-;-;-
Venue:
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Year:
1999

Citing 7
Cited 0

Introduction to Parallel & Vector Solution of Linear Systems

Introduction to Parallel & Vector Solution of Linear Systems
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Optimization Techniques and Performance Analysis for Different Serial and Parallel RISC-based Computers

PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
Iterative Algorithms on High Performance Architectures

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Combining Optimization for Cache and Instruction-Level Parallelism

PACT '96 Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques
LAPACK Working Note 58: ``The Design of Linear Algebra Libraries for High Performance Computers

LAPACK Working Note 58: ``The Design of Linear Algebra Libraries for High Performance Computers
Performance of Various Computers Using Standard Linear Equations Software

Performance of Various Computers Using Standard Linear Equations Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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