cd /news/large-language-models/an-mlir-based-compilation-method-for… · home topics large-language-models article
[ARTICLE · art-65399] src=arxiv.org ↗ pub= topic=large-language-models verified=true sentiment=· neutral

An MLIR-Based Compilation Method for Large Language Models

Researchers have developed an MLIR-based compilation method for deploying large language models on AI accelerators, addressing challenges in model import and efficient scheduling of autoregressive inference. The method uses two operator dialects—TopOp for high-level model semantics and TpuOp for hardware-specific decisions—and splits Transformer layers into three static compilation stages. Implemented in the TPU-MLIR compiler and LLM-TPU project, it supports models like Qwen, Llama, InternVL, and MiniCPM-V with multiple quantization formats.

read1 min views1 publishedJul 20, 2026

arXiv:2607.15865v1 Announce Type: new Abstract: Large Language Models (LLMs) have become the dominant workload on modern AI accelerators, yet deploying them on specialized hardware still faces two core challenges: how to import a trained model into a compiler-friendly intermediate representation, and how to efficiently schedule the autoregressive inference loop under limited on-chip memory. This paper presents an MLIR (Multi-Level Intermediate Representation) based compilation method for large language models, illustrated using two dialects of operators, TopOp and TpuOp. TopOp serves as a high-level graph dialect that is independent of both the source framework and the target chip, and is responsible for expressing model semantics; TpuOp serves as the target hardware dialect, carrying chip-related decisions such as quantization, layer groups, and memory layout. A model is first represented as TopOp, then lowered layer by layer to TpuOp, and finally a deployable binary is generated. In addition, each Transformer layer is split into three stages for static compilation: prefill, prefill_kv (prefill with historical key-value cache), and decode, so as to accommodate the different computational characteristics of prompt-parallel processing and per-token generation. The method has been implemented in the TPU-MLIR compiler{https://github.com/sophgo/tpu-mlir} and the LLM-TPU deployment project\footnote{https://github.com/sophgo/LLM-TPU}, supporting a variety of generative models including the Qwen, Llama, InternVL, and MiniCPM-V series, as well as multiple quantization and deployment forms such as GPTQ, AWQ, and AutoRound.

── more in #large-language-models 4 stories · sorted by recency
── more on @mlir 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/an-mlir-based-compil…] indexed:0 read:1min 2026-07-20 ·