mlsanityData to 7 Oct 2026

From Loop Nests to Silicon: Mapping AI Workloads onto AMD NPUs with MLIR-AIR

arXiv 2510.14871 ↗First posted 16 Oct 2025cs.CL cs.AR cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

General-purpose compilers abstract away parallelism, locality, and synchronization, limiting their effectiveness on modern spatial architectures. As modern computing architectures increasingly rely on fine-grained control over data movement, execution order, and compute placement for performance, compiler infrastructure must provide explicit mechanisms for orchestrating compute and data to fully exploit such architectures. We introduce MLIR-AIR, a novel, open-source compiler stack built on MLIR that bridges the semantic gap between high-level workloads and fine-grained spatial architectures such as AMD's NPUs. MLIR-AIR defines the AIR dialect, which provides structured representations for asynchronous and hierarchical operations across compute and memory resources. AIR primitives allow the compiler to orchestrate spatial scheduling, distribute computation across hardware regions, and overlap communication with computation without relying on ad hoc runtime coordination or manual scheduling. We demonstrate MLIR-AIR's capabilities through two case studies: matrix multiplication and the multi-head attention block from the LLaMA 2 model. For matrix multiplication, MLIR-AIR achieves up to 78.7% compute efficiency and generates implementations with performance almost identical to state-of-the-art, hand-optimized matrix multiplication written using the lower-level, close-to-metal MLIR-AIE framework. For multi-head attention, we demonstrate that the AIR interface supports fused implementations using approximately 150 lines of code, enabling tractable expression of complex workloads with efficient mapping to spatial hardware. MLIR-AIR transforms high-level structured control flow into spatial programs that efficiently utilize the compute fabric and memory hierarchy of an NPU, leveraging asynchronous execution, tiling, and communication overlap through compiler-managed scheduling.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 12 of its 44 references that are in the map. First posted on arXiv 16 Oct 2025.

Builds on

12 of 44 references.

References · 12

  1. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  2. 2023TPU v4: An Optically Reconfigurable Supercomputer for Machine Learning with Hardware Support for Embeddingscited by 198
  3. 2024SambaNova SN40L: Scaling the AI Memory Wall with Dataflow and Composition of Expertscited by 18
  4. 2020NERO: A Near High-Bandwidth Memory Stencil Accelerator for Weather Prediction Modelingcited by 8
  5. 2021FPGA-Based Near-Memory Acceleration of Modern Data-Intensive Applicationscited by 8
  6. 2025Efficiency, Expressivity, and Extensibility in a Close-to-Metal NPU Programming Interfacecited by 8
  7. 2023Revet: A Language and Compiler for Dataflow Threadscited by 6
  8. 2021Union: A Unified HW-SW Co-Design Ecosystem in MLIR for Evaluating Tensor Operations on Spatial Acceleratorscited by 5
  9. 2022RUBICON: A Framework for Designing Efficient Deep Learning-Based Genomic Basecallerscited by 5
  10. 2023SPARTA: Spatial Acceleration for Efficient and Scalable Horizontal Diffusion Weather Stencil Computationcited by 3
  11. 2022Designing, Modeling, and Optimizing Data-Intensive Computing Systemscited by 1
  12. 2025Unlocking the AMD Neural Processing Unit for ML Training on the Client Using Bare-Metal-Programming Toolscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.