Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization
Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization
复制标题
使用 Cholesky 分解在 CELL 处理器上求解线性方程组
DOI:
10.1109/tpds.2007.70813
复制
发表时间:
2008
影响因子:
5.3
通讯作者:
J. Dongarra
中科院分区:
文献类型:
--
作者:
J. Kurzak;A. Buttari;J. Dongarra
The Sony/Toshiba/IBM (STI) CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is effective exploitation of the differential between the speed of single and double precision arithmetic; the other is efficient parallelization between the short vector SIMD cores. The first challenge is addressed by utilizing the well known technique of iterative refinement for the solution of a dense symmetric positive definite system of linear equations, resulting in a mixed-precision algorithm, which delivers double precision accuracy, while performing the bulk of the work in single precision. The main contribution of this paper lies in addressing the second challenge by successful thread-level parallelization, exploiting fine-grained task granularity and a lightweight decentralized synchronization. The implementation of the computationally intensive sections gets within 90 percent of peak floating point performance, while the implementation of the memory intensive sections reaches within 90 percent of peak memory bandwidth. On a single CELL processor, the algorithm achieves over 170~Gflop/s when solving a symmetric positive definite system of linear equation in single precision and over 150~Gflop/s when delivering the result in double precision accuracy.