Taichi: a language for high-performance computation on spatially sparse data structures
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
3D visual computing data are often spatially sparse. To exploit such sparsity, people have developed hierarchical sparse data structures, such as multi-level sparse voxel grids, particles, and 3D hash tables. However, developing and using these high-performance sparse data structures is challenging, due to their intrinsic complexity and overhead. We propose Taichi , a new data-oriented programming language for efficiently authoring, accessing, and maintaining such data structures. The language offers a high-level, data structure-agnostic interface for writing computation code. The user independently specifies the data structure. We provide several elementary components with different sparsity properties that can be arbitrarily composed to create a wide range of multi-level sparse data structures. This decoupling of data structures from computation makes it easy to experiment with different data structures without changing computation code, and allows users to write computation as if they are working with a dense array. Our compiler then uses the semantics of the data structure and index analysis to automatically optimize for locality, remove redundant operations for coherent accesses, maintain sparsity and memory allocations, and generate efficient parallel and vectorized instructions for CPUs and GPUs. Our approach yields competitive performance on common computational kernels such as stencil applications, neighbor lookups, and particle scattering. We demonstrate our language by implementing simulation, rendering, and vision tasks including a material point method simulation, finite element analysis, a multigrid Poisson solver for pressure projection, volumetric path tracing, and 3D convolution on sparse grids. Our computation-data structure decoupling allows us to quickly experiment with different data arrangements, and to develop high-performance data structures tailored for specific computational tasks. With 1 1 0 th as many lines of code, we achieve 4.55× higher performance on average, compared to hand-optimized reference implementations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
3D Semantic Segmentation with Submanifold Sparse Convolutional Networks
Graham, B., Engelcke, M., & Maaten, L. V. D. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00961 · Cited by 1,788
OctNet: Learning Deep 3D Representations at High Resolutions
Riegler, G., Ulusoy, A. O., & Geiger, A. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.701 · Cited by 1,589
O-CNN: octree-based convolutional neural networks for 3D shape analysis
Wang, P.-S., Liu, Y., Guo, Y.-X., Sun, C.-Y., & Tong, X. (2017) · ACM Transactions on Graphics · doi:10.1145/3072959.3073608 · Cited by 884
Zhu, Y., & Bridson, R. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073298 · Cited by 648
A material point method for snow simulation
Stomakhin, A., Schroeder, C., Chai, L., Teran, J. M., & Selle, A. P. (2013) · ACM Transactions on Graphics · doi:10.1145/2461912.2461948 · Cited by 611
Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., & Amarasinghe, S. (2013) · ACM SIGPLAN Notices · doi:10.1145/2499370.2462176 · Cited by 513
Self-citationKjolstad, F., Kamil, S., Chou, S., Lugato, D., & Amarasinghe, S. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3133901 · Cited by 358
Hu, Y., Fang, Y., Ge, Z., Qu, Z., Zhu, Y., Pradhana, A., & Jiang, C. (2018) · ACM Transactions on Graphics · doi:10.1145/3197517.3201293 · Cited by 274
Self-citationDecoupling algorithms from schedules for easy optimization of image processing pipelines
Ragan-Kelley, J., Adams, A., Paris, S., Levoy, M., Amarasinghe, S., & Durand, F. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185528 · Cited by 251
Self-citationScalable real-time volumetric surface reconstruction
Chen, J., Bautembach, D., & Izadi, S. (2013) · ACM Transactions on Graphics · doi:10.1145/2461912.2461940 · Cited by 247
Rendering complex scenes with memory-coherent ray tracing
Pharr, M., Kolb, C., Gershbein, R., & Hanrahan, P. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258791 · Cited by 215
Liszt: a domain specific language for building portable mesh-based PDE solvers
DeVito, Z., Joubert, N., Palacios, F., Oakley, S., Medina, M., Barrientos, M., Elsen, E., Ham, F., Aiken, A., Duraisamy, K., et al. (2011) · Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1145/2063384.2063396 · Cited by 200
Adaptive O-CNN: a patch-based deep representation of 3D shapes
Wang, P.-S., Sun, C.-Y., Liu, Y., & Tong, X. (2018) · ACM Transactions on Graphics · doi:10.1145/3272127.3275050 · Cited by 193
ispc: A SPMD compiler for high-performance CPU programming
Pharr, M., & Mark, W. R. (2012) · 2012 Innovative Parallel Computing (InPar) · doi:10.1109/inpar.2012.6339601 · Cited by 191
A single-program-multiple-data computational model for EPEX/FORTRAN
Darema, F., George, D. A., Norton, V. A., & Pfister, G. F. (1988) · Parallel Computing · doi:10.1016/0167-8191(88)90094-4 · Cited by 182
GraphIt: a high-performance graph DSL
Zhang, Y., Yang, M., Baghdadi, R., Kamil, S., Shun, J., & Amarasinghe, S. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3276491 · Cited by 169
Format abstraction for sparse tensor algebra compilers
Chou, S., Kjølstad, F., & Amarasinghe, S. P. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3276493 · Cited by 146
Narrow-band topology optimization on a sparsely populated grid
Liu, H., Hu, Y., Zhu, B., Matusik, W., & Sifakis, E. D. (2018) · ACM Transactions on Graphics · doi:10.1145/3272127.3275012 · Cited by 101
Self-citationSimit: A Language for Physical Simulation
Kjølstad, F., Kamil, S. A., Ragan‐Kelley, J., Levin, D. I. W., Sueda, S., Chen, D., Vouga, E., Kaufman, D. M., Kanwar, G., Matusik, W., et al. (2016) · ACM Transactions on Graphics · doi:10.1145/2866569 · Cited by 68
Self-citationParSy: Inspection and Transformation of Sparse Matrix Computations for Parallelism
Cheshmi, K., Kamil, S. A., Strout, M. M., & Dehnavi, M. M. (2018) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2018.00065 · Cited by 44
Bernstein, G., Shah, C., Lemire, C., DeVito, Z., Fisher, M., Levis, P. A., & Hanrahan, P. (2016) · ACM Transactions on Graphics · doi:10.1145/2892632 · Cited by 38
Cited by
Tewari, A., Thies, J., Mildenhall, B., Srinivasan, P., Tretschk, E., Yifan, W., Lassner, C., Sitzmann, V., Martin‐Brualla, R., Lombardi, S., et al. (2022) · Computer Graphics Forum · doi:10.1111/cgf.14507 · Cited by 339
SAGCI-System: Towards Sample-Efficient, Generalizable, Compositional, and Incremental Robot Learning
Lv, J., Yu, Q., Shao, L., Liu, W., Xu, W., & Lu, C. (2022) · 2022 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra46639.2022.9811859 · Cited by 22
Metadata
- Authors
- Hu, Y., Li, T.-M., Anderson, L., Ragan-Kelley, J., & Durand, F.
- Venue
- ACM Transactions on Graphics
- Published
- 2019-11-08
- Volume
- 38
- Issue
- 6
- Pages
- 1-16
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2977371611
- Cited by
- 257
- References
- 22
- FWCI
- 37.43
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.