Design and Implementation of Parallelized Cholesky Factorization

摘要：

The bottleneck of most data analyzing systems, signal processing systems, and intensive computing systems is matrix decomposition. The Cholesky factorization of a sparse matrix is an important operation in numerical algorithms field. This paper presents a Multi-phased Parallel Cholesky Factorization (MPCF) algorithm, and then gives the implementation on a multi-core machine. A performance result shows that the system can reach 85.7 Gflop/s on a single PowerXCell processor and bulk of computation can reach to 94% of peak performance.

作者: Bailing Wang Ning Ge Hongbo Peng Qiong Wei Guanglei Li Zhigang Gong

作者单位: School of Electronic Engineering and Computer Science,Peking University, Beijing 100871, China Resea IBM China System and Technology Lab,Beijing 100000, China

会议类型: 国际会议

会议名称: The Second International Conference on High Performance Computing and Applications(第二届高性能计算及应用国际会议)

会议地点: 上海

会议语种:英文

页码: 390-397

在线出版日期: 2009-08-10（万方平台首次上网日期，不代表论文的发表时间）