Level-3 Cholesky Factorization Routines Improve Performance of Many Cholesky Algorithms

Fred G. Gustavson, Jerzy Wasniewski, Jack J. Dongarra, Jośe R. Herrero, Julien Langou

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

Four routines called DPOTF3i, i = a,b,c,d, are presented. DPOTF3i are a novel type of level-3 BLAS for use by BPF (Blocked Packed Format) Cholesky factorization and LAPACK routine DPOTRF. Performance of routines DPOTF3i are still increasing when the performance of Level-2 routine DPOTF2 of LAPACK starts decreasing. This is our main result and it implies, due to the use of larger block size nb, that DGEMM, DSYRK, and DTRSM performance also increases! The four DPOTF3i routines use simple register blocking. Different platforms have different numbers of registers. Thus, our four routines have different register blocking sizes. BPF is introduced. LAPACK routines for POTRF and PPTRF using BPF instead of full and packed format are shown to be trivial modifications of LAPACK POTRF source codes. We call these codes BPTRF. There are two variants of BPF: lower and upper. Upper BPF is "identical" to Square Block Packed Format (SBPF). "LAPACK" implementations on multicore processors use SBPF. Lower BPF is less efficient thanupper BPF. Vector inplace transposition converts lower BPF to upper BPF very efficiently. Corroborating performance results for DPOTF3i versus DPOTF2 on a variety of common platforms are given for n ≈ nb as well as results for large n comparing DBPTRF versus DPOTRF. © 2013 ACM.
Original languageEnglish
JournalA C M Transactions on Mathematical Software
Volume39
Issue number2
Pages (from-to)Article No. 9
Number of pages10
ISSN0098-3500
DOIs
Publication statusPublished - 2013

Keywords

  • Computer software
  • Software engineering
  • Data structures

Fingerprint Dive into the research topics of 'Level-3 Cholesky Factorization Routines Improve Performance of Many Cholesky Algorithms'. Together they form a unique fingerprint.

Cite this