LoopStack: a Lightweight Tensor Algebra Compiler Stack
Not on the map. Why?
Abstract (arXiv)
We present LoopStack, a domain specific compiler stack for tensor operations, composed of a frontend, LoopTool, and an efficient optimizing code generator, LoopNest. This stack enables us to compile entire neural networks and generate code targeting the AVX2, AVX512, NEON, and NEONfp16 instruction sets while incorporating optimizations often missing from other machine learning compiler backends. We evaluate our stack on a collection of full neural networks and commonly used network blocks as well as individual operators, and show that LoopStack generates machine code that matches and frequently exceeds the performance of in state-of-the-art machine learning frameworks in both cases. We also show that for a large collection of schedules LoopNest's compilation is orders of magnitude faster than LLVM, while resulting in equal or improved run time performance. Additionally, LoopStack has a very small memory footprint - a binary size of 245KB, and under 30K lines of effective code makes it ideal for use on mobile and embedded devices.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 63 references that are in the map. First posted on arXiv 2 May 2022.
Builds on
6 of 63 references.
References · 6
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2019Searching for MobileNetV3cited by 1,994
- 2014cuDNN: Efficient Primitives for Deep Learningcited by 245
- 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 201
- 2018Learning to Optimize Tensor Programscited by 140
- 2019Fast Sparse ConvNetscited by 86
Built on by
Citing papers per year: 2023: 1.
1 paper.