The performance of the BLAS and LAPACK on a shared memory scalar multiprocessor

Authors:
Chris Phillips
Affiliations:
-
Venue:
Parallel Computing
Year:
1991

Citing 6
Cited 0

An extended set of FORTRAN basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs

ACM Transactions on Mathematical Software (TOMS)
Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs

ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Basic Linear Algebra Subprograms for Fortran Usage

ACM Transactions on Mathematical Software (TOMS)
Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

LAPACK is a set of Fortran subroutines covering a wide area of linear algebra algorithms. It was developed with the intention of being portable across a range of parallel processing environments. We consider here the performance of the Basic Linear Algebra Subprograms (BLAS) on which this software is based, on a shared memory multiprocessor, with each processing element possessing scalar characteristics only. We then investigate the effect of the block size on the performance of certain of the LAPACK routines when executed in the same environment.