AsyncTaichi: On-the-fly Inter-kernel Optimizations for Imperative and Spatially Sparse Programming
Yuanming Hu, Mingkuan Xu, Ye Kuang, Fr\'edo Durand

TL;DR
AsyncTaichi introduces a novel system that optimizes inter-kernel execution for sparse computations in 3D graphics, significantly reducing kernel launches and improving performance without code modifications.
Contribution
It presents a domain-specific data-flow graph model and an asynchronous execution engine for optimizing sparse kernel interactions across multiple kernels.
Findings
4.02× fewer kernel launches
1.87× speedup on GPU benchmarks
Effective optimization of sparse computations
Abstract
Leveraging spatial sparsity has become a popular approach to accelerate 3D computer graphics applications. Spatially sparse data structures and efficient sparse kernels (such as parallel stencil operations on active voxels), are key to achieve high performance. Existing work focuses on improving performance within a single sparse computational kernel. We show that a system that looks beyond a single kernel, plus additional domain-specific sparse data structure analysis, opens up exciting new space for optimizing sparse computations. Specifically, we propose a domain-specific data-flow graph model of imperative and sparse computation programs, which describes kernel relationships and enables easy analysis and optimization. Combined with an asynchronous execution engine that exposes a wide window of kernels, the inter-kernel optimizer can then perform effective sparse computation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · 3D Shape Modeling and Analysis · Computer Graphics and Visualization Techniques
