HPF and Numerical Libraries

Authors:
Harald J. Ehold;Wilfried N. Gansterer;Dieter F. Kvasnicka;Christoph W. Ueberhuber
Affiliations:
-;-;-;-
Venue:
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Year:
1999

Citing 12
Cited 0

Algorithm 656: an extended set of 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)
LAPACK's user's guide

LAPACK's user's guide
Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology

ICS '97 Proceedings of the 11th international conference on Supercomputing
Using PLAPACK: parallel linear algebra package

Using PLAPACK: parallel linear algebra package
ScaLAPACK user's guide

ScaLAPACK user's guide
Basic Linear Algebra Subprograms for Fortran Usage

ACM Transactions on Mathematical Software (TOMS)
Numerical Computation, Volume I

Numerical Computation, Volume I
Realization of an HPF Interface to ScaLAPACK with Redistributions

HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
High Performance Fortran Interfacing to ScaLAPACK

PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
Optimizing Matrix Multiply using PHiPAC: a Portable,High-Performance, ANSI C Coding Methodology

Optimizing Matrix Multiply using PHiPAC: a Portable,High-Performance, ANSI C Coding Methodology
Automatically Tuned Linear Algebra Software

Automatically Tuned Linear Algebra Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

Portable and efficient ways for calling numerical high performance software libraries from HPF programs are investigated. The methods suggested utilize HPF's EXTRINSIC mechanism and are independent of implementation details of HPF compilers. Two prototypical examples are used to illustrate these techniques. Highly optimized BLAS routines are utilized for local computations: (i) in parallel multiplication of matrices, and (ii) in parallel Cholesky factorization. Both implementations turn out to be very efficient and show significant improvements over standard HPF implementations.