Towards a high-performance AI compiler with upstream MLIR
Not on the map. Why?
Abstract (arXiv)
This work proposes a compilation flow using open-source compiler passes to build a framework to achieve ninja performance from a generic linear algebra high-level abstraction. We demonstrate this flow with a proof-of-concept MLIR project that uses input IR in Linalg-on-Tensor from TensorFlow and PyTorch, performs cache-level optimizations and lowering to micro-kernels for efficient vectorization, achieving over 90% of the performance of ninja-written equivalent programs. The contributions of this work include: (1) Packing primitives on the tensor dialect and passes for cache-aware distribution of tensors (single and multi-core) and type-aware instructions (VNNI, BFDOT, BFMMLA), including propagation of shapes across the entire function; (2) A linear algebra pipeline, including tile, fuse and bufferization strategies to get model-level IR into hardware friendly tile calls; (3) A mechanism for micro-kernel lowering to an open source library that supports various CPUs.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 3 of its 7 references that are in the map. First posted on arXiv 15 Apr 2024.
Builds on
3 of 7 references.
References · 3
- 2021Tensor Processing Primitives: A Programming Abstraction for Efficiency and Portability in Deep Learning & HPC Workloadscited by 9
- 2023oneDNN Graph Compiler: A Hybrid Approach for High-Performance Deep Learning Compilationcited by 7
- 2023Harnessing Deep Learning and HPC Kernels via High-Level Loop and Tensor Abstractions on CPU Architecturescited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.