Publication | Open Access
Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization Routines
211
Citations
16
References
1995
Year
Numerical AnalysisEngineeringAlgorithmic LibraryComputer ArchitectureScalapack LibraryScalapack LuParallel AnalysisHigh-performance ArchitectureSystems EngineeringParallel ComputingCholesky Factorization RoutinesApproximation TheoryLow-rank ApproximationMassively-parallel ComputingQuantum Field TheoryComputer EngineeringCore Factorization RoutinesComputer ScienceComputational ScienceHardware AccelerationMatrix FactorizationComputer AlgebraParallel ProgrammingData-level ParallelismVectorizationScalapack Factorization Routines
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1