Poster Type: Research Posters
Author: Felix Lindner (Friedrich Schiller University Jena), Alex Breuer (Friedrich Schiller University Jena)
Abstract: Tensor contractions are core kernels in scientific computing and machine learning. Efficient execution requires hardware-aware tiling and a schedule across cores and over time that depends on the contraction and the microarchitecture. Existing systems search this space with auto-tuning (TVM), optimize it with library heuristics (BLIS, TBLIS), or transpose whole tensors around a GEMM (TTGT). Recent systems expose tiles explicitly, from programming environments (cuTile, Triton-CPU) to tile-based primitives (KleidiAI, CUTLASS, LIBXSMM). We introduce the Tiled Execution Intermediate Representation (TEIR), which explicitly represents what runs (kernels on tiles), when it runs (an execution schedule), and how data is laid out (per-tensor strides and offsets). We implement TEIR as an MLIR dialect whose optimization passes schedule a contraction and lower it to LIBXSMM kernels. Across 24 TCCG contractions on AVX-512, NEON, and SME, TEIR achieves 1.5×–1.9× the geometric-mean throughput of the next-best backends and leads in 54 of 72 cases.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF