.png){kind=icon}
返回
Sparsity-Specific Code Optimization using Expression Trees
.png){kind=icon}
OA
AI
DOI：10.1145/3520484.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a code generator that converts unoptimized C++ code operating on sparse data into vectorized and parallel CPU or GPU kernels. Our approach unrolls the computation into a massive expression graph, performs redundant expression elimination, grouping, and then generates an architecture-specific kernel to solve the same problem, assuming that the sparsity pattern is fixed, which is a common scenario in many applications in computer graphics and scientific computing. We showthat our approach scales to large problems and can achieve speedups of two orders of magnitude on CPUs and three orders of magnitude on GPUs, compared to a set of manually optimized CPU baselines. To demonstrate the practical applicability of our approach, we employ it to optimize popular algorithms with applications to physical simulation and interactive mesh deformation.
Keyword:
Code optimisation
sparse computation
期刊
IF:
9.5
论文数:
4.8K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Nonlinear vibration of full-filled fluid corrugated sandwich functionally graded cylindrical shells
PREAI
分享收藏Intra‐individual cytokine profile in peri‐implantitis and periodontitis: A cross‐sectional study
OAAI
OAAI分享收藏
查看更多内容