.png){kind=icon}
返回
EXPOSING FINE-GRAINED PARALLELISM IN ALGEBRAIC MULTIGRID METHODS
.png){kind=icon}
PRE
AI
DOI：10.1137/110838844.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Algebraic multigrid methods for large, sparse linear systems are a necessity in many computational simulations, yet parallel algorithms for such solvers are generally decomposed into coarse-grained tasks suitable for distributed computers with traditional processing cores. However, accelerating multigrid methods on massively parallel throughput-oriented processors, such as graphics processing units, demands algorithms with abundant fine-grained parallelism. In this paper, we develop a parallel algebraic multigrid method which exposes substantial fine-grained parallelism in both the construction of the multigrid hierarchy as well as the cycling or solve stage. Our algorithms are expressed in terms of scalable parallel primitives that are efficiently implemented on the GPU. The resulting solver achieves an average speedup of 1.8x in the setup phase and 5.7x in the cycling phase when compared to a representative CPU implementation.
Keyword:
algebraic multigrid
parallel
sparse
graphics processing units
iterative
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Severe Liver Degeneration in Mice Lacking the IκB Kinase 2 Gene缺乏i κ b激酶2基因的小鼠的严重肝脏变性.png)
Science
ScienceIF0
PREAI
分享收藏
查看更多内容