Efficient parallel algorithms for dense Cholesky factorization

DOI10.1007/3-540-49164-3_69MaRDI QIDQ4249175zbMATH OpenFDO

Authors Eunice E. Santos, Pei-Yue Chu

Publication date 13 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49164-3_69

zbMATH Keywords

dense Cholesky factorizationgaplatencyLogPnumber of processor/memory pairsoverheadparallel algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Review text

Dense Cholesky factorization arises in areas such as linear programming, boundary element methods and radiosity computations. In this paper we focus on designing efficient parallel algorithms for Cholesky factorization. In order to take portability into account, we utilize LogP in our performance analysis. LogP is a general parallel model utilizing point-to-point communication. The model captures important characteristics of parallel machines without taking into account specifics such as the interconnection network in order to deal with portability issues. The four parameters of LogP are: \(({\mathbf L})\): latency; \(({\mathbf o})\): overhead; \(({\mathbf g})\): gap; and \(({\mathbf P})\): number of processor/memory pairs. For ease of discussion, we assume that \(L= g\) and \(o= 0\). For the entire collection see [Zbl 0909.00047].

Recommendations

• scientific article; zbMATH DE number 641618
• Highly Parallel Sparse Cholesky Factorization
• Performance of parallel Cholesky factorization algorithms using BLAS
• Parallel Cholesky factorization on a shared-memory multiprocessor

Cited in

(10)

• Sparse Cholesky factorization on FPGA using parameterized model
• A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• scientific article; zbMATH DE number 815482 (Why is no real title available?)
• Performance evaluation of practical parallel computer model LogPQ
• Parallel Cholesky-based reduction for the weighted integer least squares problem
• Task scheduling for parallel sparse Cholesky factorization

This page was built for publication: Efficient parallel algorithms for dense Cholesky factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249175)