The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
The tensor algebra compiler
Open accessAbstract
Tensor algebra is a powerful tool with applications in machine learning, data analytics, engineering and the physical sciences. Tensors are often sparse and compound operations must frequently be computed in a single kernel for performance and to save memory. Programmers are left to write kernels for every operation of interest, with different mixes of dense and sparse tensors in different formats. The combinations are infinite, which makes it impossible to manually implement and optimize them all. This paper introduces the first compiler technique to automatically generate kernels for any compound tensor algebra operation on dense and sparse tensors. The technique is implemented in a C++ library called taco. Its performance is competitive with best-in-class hand-optimized kernels in popular libraries, while supporting far more tensor operations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
TensorFlow: A system for large-scale machine learning
Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08695 · Cited by 11,822
The NumPy Array: A Structure for Efficient Numerical Computation
van der Walt, S., Colbert, S. C., & Varoquaux, G. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2011.37 · Cited by 9,381
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Die Grundlage der allgemeinen Relativitätstheorie
Einstein, A. (1916) · Annalen der Physik · doi:10.1002/andp.19163540702 · Cited by 3,468
Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries
Balay, S., Gropp, W. D., McInnes, L. C., & Smith, B. F. (1997) · Modern Software Tools for Scientific Computing · doi:10.1007/978-1-4612-1986-6_8 · Cited by 2,009
The Foundation of the General Theory of Relativity (1916)
(2025) · The Essential Einstein: Scientific Writings · doi:10.2307/jj.27710910.18 · Cited by 1,692
Hidden factors and hidden topics: understanding rating dimensions with review text
McAuley, J., & Leskovec, J. (2013) · Proceedings of the 7th ACM conference on Recommender systems · doi:10.1145/2507157.2507163 · Cited by 1,564
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461
A data locality optimizing algorithm
Wolf, M. E., & Lam, M. S. (1991) · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91 · doi:10.1145/113445.113449 · Cited by 1,331
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,134
Iverson, K. E. (1962) · Proceedings of the May 1-3, 1962, spring joint computer conference on - AIEE-IRE '62 (Spring) · doi:10.1145/1460833.1460872 · Cited by 1,067
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/509058.509096 · Cited by 854
Optimizing supercompilers for supercomputers
Wolfe, M. (2020) · Proceedings of the 34th ACM International Conference on Supercomputing · doi:10.1145/3392717.3400034 · Cited by 837
Direct solutions of sparse network equations by optimally ordered triangular factorization
Tinney, W. F., & Walker, J. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.6011 · Cited by 811
Optimization of sparse matrix-vector multiplication on emerging multicore platforms
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J. (2007) · Proceedings of the 2007 ACM/IEEE conference on Supercomputing · doi:10.1145/1362622.1362674 · Cited by 791
Optimization of sparse matrix–vector multiplication on emerging multicore platforms
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J. (2009) · Parallel Computing · doi:10.1016/j.parco.2008.12.006 · Cited by 789
Tensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
Julia: A Fast Dynamic Language for Technical Computing
Anderson, T. A., Liu, H., Kuper, L., Totoni, E., Vitek, J., & Shpeisman, T. (2012) · arXiv (Cornell University) · doi:10.4230/lipics.ecoop.2017.4 · Cited by 627
Improving data locality with loop transformations
McKinley, K. S., Carr, S., & Tseng, C.-W. (1996) · ACM Transactions on Programming Languages and Systems · doi:10.1145/233561.233564 · Cited by 551
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Proceedings of the IEEE/ACM SC98 Conference · doi:10.1109/sc.1998.10004 · Cited by 527
OSKI: A library of automatically tuned sparse matrix kernels
Vuduc, R., Demmel, J. W., & Yelick, K. A. (2005) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/16/1/071 · Cited by 490
M�thodes de calcul diff�rentiel absolu et leurs applications
Ricci, M. M. G., & Levi-Civita, T. (1900) · Mathematische Annalen · doi:10.1007/bf01454201 · Cited by 444
Buluç, A., Fineman, J. T., Frigo, M., Gilbert, J. R., & Leiserson, C. E. (2009) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1583991.1584053 · Cited by 430
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
Gustavson, F. G. (1978) · ACM Transactions on Mathematical Software · doi:10.1145/355791.355796 · Cited by 410
SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication
Smith, S., Ravindran, N., Sidiropoulos, N. D., & Karypis, G. (2015) · 2015 IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2015.27 · Cited by 206
On the representation and multiplication of hypersparse matrices
Buluc, A., & Gilbert, J. R. (2008) · 2008 IEEE International Symposium on Parallel and Distributed Processing · doi:10.1109/ipdps.2008.4536313 · Cited by 201
A massively parallel tensor contraction framework for coupled-cluster computations
Solomonik, E., Matthews, D., Hammond, J. R., Stanton, J. F., & Demmel, J. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.06.002 · Cited by 193
LAPACK Users' guide (third ed.)
Anderson, E., Bai, Z., Bischof, C. H., Blackford, L. S., Demmel, J. W., Dongarra, J. J., Croz, J. D., Hammarling, S. J., Greenbaum, A. B., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · Cited by 178
Epifanovsky, E., Wormit, M., Kuś, T., Landau, A., Zuev, D., Khistyaev, K., Manohar, P. U., Kaliman, I. A., Dreuw, A., & Krylov, A. I. (2013) · Journal of Computational Chemistry · doi:10.1002/jcc.23377 · Cited by 149
Tensor-matrix products with a compressed sparse tensor
Smith, S., & Karypis, G. (2015) · Irregular Applications: Architectures and Algorithms · doi:10.1145/2833179.2833183 · Cited by 147
Scalable sparse tensor decompositions in distributed memory systems
Kaya, O., & Uçar, B. (2015) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/2807591.2807624 · Cited by 101
Loop and data transformations for sparse matrix code
Venkat, A., Hall, M. W., & Strout, M. M. (2015) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2737924.2738003 · Cited by 91
High-Performance Tensor Contraction without Transposition
Matthews, D. A. (2018) · SIAM Journal on Scientific Computing · doi:10.1137/16m108968x · Cited by 88
Efficient and scalable computations with sparse tensors
Baskaran, M. M., Meister, B., Vasilache, N., & Lethin, R. (2012) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2012.6408676 · Cited by 74
A relational approach to the compilation of sparse matrix programs
Kotlyar, V., Pingali, K. K., & Stodghill, P. V. (1997) · Lecture notes in computer science · doi:10.1007/bfb0002751 · Cited by 65
Simit: 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 63
Self-citationA Basic Linear Algebra Compiler
Spampinato, D. G., & Püschel, M. (2014) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/2544137.2544155 · Cited by 60
SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations
Pugh, W., & Shpeisman, T. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48319-5_14 · Cited by 39
Optimizing Sparse Tensor Times Matrix on Multi-core and Many-Core Architectures
Li, J., Ma, Y., Yan, C. C., & Vuduc, R. W. (2016) · Irregular Applications: Architectures and Algorithms · doi:10.1109/ia3.2016.010 · Cited by 29
Autotuning Sparse Matrix-Vector Multiplication for Multicore
Byun, J.-H., Lin, R. C.-H., Yelick, K., & Demmel, J. W. (2012) · Cited by 27
Sparso: Context-driven Optimizations of Sparse Linear Algebra
Rong, H., Park, J., Xiang, L., Anderson, T. A., & Smelyanskiy, M. (2016) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1145/2967938.2967943 · Cited by 25
Optimizing sparse tensor times matrix on multi-core and many-core architectures
Li, J., Ma, Y., Yan, C. C., & Vuduc, R. W. (2016) · Irregular Applications: Architectures and Algorithms · doi:10.5555/3018843.3018848 · Cited by 25
A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes
Stodghill, P. V. (1997) · eCommons (Cornell University) · Cited by 24
Optimization of symmetric tensor computations
Cai, J., Baskaran, M. M., Meister, B., & Lethin, R. (2015) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2015.7322458 · Cited by 12
High Performance Machine Learning through Codesign and Rooflining
Zhao, H. (2014) · eScholarship (California Digital Library) · Cited by 10
Data-parallel language for correct and efficient sparse matrix codes
Bodík, R., & Arnold, G. (2011) · Cited by 8
Scalable, Portable, Verifiable Kronecker Products on Multi-scale Computers
Mullin, L., & Raynolds, J. E. (2014) · Studies in computational intelligence · doi:10.1007/978-3-319-04280-0_14 · Cited by 6
Cited by
Timeloop: A Systematic Approach to DNN Accelerator Evaluation
Parashar, A., Raina, P., Shao, Y. S., Chen, Y.-H., Ying, V. A., Mukkara, A., Venkatesan, R., Khailany, B., Keckler, S. W., & Emer, J. (2019) · 2019 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) · doi:10.1109/ispass.2019.00042 · Cited by 571
Taichi: a language for high-performance computation on spatially sparse data structures
Hu, Y., Li, T.-M., Anderson, L., Ragan-Kelley, J., & Durand, F. (2019) · ACM Transactions on Graphics · doi:10.1145/3355089.3356506 · Cited by 257
Verified Code Transpilation with LLMs
Bhatia, S., Qiu, J., Hasabnis, N., Seshia, S., & Cheung, A. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-1310 · Cited by 12
Metadata
- Authors
- Kjolstad, F., Kamil, S., Chou, S., Lugato, D., & Amarasinghe, S.
- Venue
- Proceedings of the ACM on Programming Languages
- Published
- 2017-10-12
- Volume
- 1
- Issue
- OOPSLA
- Pages
- 1-29
- ISSN
- 2475-1421 (ISSN-L)
- OpenAlex
- W2590246587
- Cited by
- 358
- References
- 49
- FWCI
- 31.33
- 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.