Institutional Repository
| 大规模稀疏线性方程组的GMRES-GPU快速求解算法 | |
| 柳有权; 尹康学; 吴恩华 | |
| 2011 | |
| Source | 计算机辅助设计与图形学学报
 |
| ISSN | 10039775 |
| Volume | 23Issue:4Pages:553-560 |
| English Abstract | 重开始广义极小残量法(GMRES)是求解大规模线性方程组的常用算法之一,具有收敛速度快、稳定性好等优点.文中基于CUDA将GMRES算法在GPU上进行并行算法实现,尤其针对稀疏矩阵矢量乘法运算,通过合并访问和共享内存策略相结合的手段使得算法效率大幅度提升.对于大规模数据集,在GeForce GTX 260上的运行结果相对于Intel Core 2 Quad CPU Q9400@2.66 GHz得到了平均40余倍的加速效果,相对于Intel Core i7 CPU 920@2.67 GHz也可得到平均20余倍的加速效果. |
| Abstract | As a popular iterative method to solve linear equations, restarted generalized minimal residual method (GMRES) has the advantages of fast convergence and good stability. This paper implements a parallel GMRES in GPU based on CUDA. Particularly, the sparse matrix vector multiplication is optimized with coherence visiting and shared memory, which significantly improves the performance. We tested the paralleled GMRES on a GPU of GeForce GTX260, and compared its performance with those of the traditional GMRES on Intel Core 2 Quad CPU Q9400@2.66GHz and Intel Core i7 CPU 920@2.67GHz, which showed 40 times of speed-up and 20 times of speed-up on average respectively. |
| Keyword | Cuda Gpgpu 重开始广义极小残量法 稀疏矩阵矢量乘法linear Systems Program Processors |
| Department | 长安大学信息工程学院;中国科学院软件研究所计算机科学国家重点实验室;澳门大学科技学院 |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/13975 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | 柳有权,尹康学,吴恩华. 大规模稀疏线性方程组的GMRES-GPU快速求解算法[J]. 计算机辅助设计与图形学学报,2011,23(4):553-560. |
| APA | 柳有权,尹康学,&吴恩华.(2011).大规模稀疏线性方程组的GMRES-GPU快速求解算法.计算机辅助设计与图形学学报,23(4),553-560. |
| MLA | 柳有权,et al."大规模稀疏线性方程组的GMRES-GPU快速求解算法".计算机辅助设计与图形学学报 23.4(2011):553-560. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 大规模稀疏线性方程组的GMRES_GPU（1585KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment