Use of parallel level 3 BLAS in LU factorization  on three vector multiprocessors the ALLIANT FX/80, the CRAY-2, and the IBM 3090 VF

Daydé, Michel; Duff, I. S.

doi:10.1145/77726.255142

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1992

1994

Publication Types

Select...

Article3

Book1

Other1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 6 publications

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Performance of parallel Cholesky factorization algorithms using BLAS

Luecke

Yun

Smith³

1992

J Supercomput

View full text Add to dashboard Cite

This paper considers four parallel Cholesky factorization algorithms, including SPOTRF from the February 1992 release of LAPACK, each of which call parallel Level 2 or 3 BLAS, or both. A fifth parallel Cholesky algorithm that calls serial Level 3 BLAS is also described. The efficiency of these five algorithms on the CRAY-2, CRAY Y-MP/832, Hitachi Data Systems EX 80, and IBM 3090-600J is evaluated and compared with a vendoroptimized parallel Cholesky factorization algorithm. The fifth parallel Cholesky algorithm that calls serial Level 3 BLAS provided the best performance of all algorithms that called BLAS routines. In fact, this algorithm outperformed the Cray-optimized libsci routine (SPOTRF) by 13-44 %, depending on the problem size and the number of processors used.

show abstract