.png){kind=icon}
Return
Sparsity-Specific Code Optimization using Expression Trees
.png){kind=icon}
OA
AI
DOI：10.1145/3520484.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Code optimisation
sparse computation
Journal
IF:
9.5
Papers:
4.8K
Citations:
3.6W
Organization
View more organizations
Cited Papers
.png){kind=icon}
Nonlinear vibration of full-filled fluid corrugated sandwich functionally graded cylindrical shells
PREAI
ShareSaveIntra‐individual cytokine profile in peri‐implantitis and periodontitis: A cross‐sectional study
OAAI
OAAIShareSaveShareSave View more