Design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines

Jaeyoung Choi, Jack J. Dongarra, L. Susan Ostrouchov, Antoine P. Petitet, David W. Walker, R. Clint Whaley

    Research output: Contribution to journalArticlepeer-review

    96 Downloads (Pure)


    This article discusses the core factorization routines included in the ScaLAPACK library. These routines allow the factorization and solution of a dense system of linear equations via LU, QR, and Cholesky. They are implemented using a block cyclic data distribution, and are built using de facto standard kernels for matrix and vector operations (BLAS and its parallel counterpart PBLAS) and message passing communication (BLACS). In implementing the ScaLAPACK routines, a major objective was to parallelize the corresponding sequential LAPACK using the BLAS, BLACS, and PBLAS as building blocks, leading to straightforward parallel implementations without a significant loss in performance. We present the details of the implementation of the ScaLAPACK factorization routines, as well as performance and scalability results on the Intel iPSC/860, Intel Touchstone Delta, and Intel Paragon System.
    Original languageEnglish
    Pages (from-to)173-184
    Number of pages11
    JournalScientific Programming
    Issue number3
    Publication statusPublished - Sept 1996


    Dive into the research topics of 'Design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines'. Together they form a unique fingerprint.

    Cite this