paper-with-me

Papers

MPK: A Compiler and Runtime for Mega-Kernelizing Tensor Programs

2025-12-22 · Xinhao Cheng, Zhihao Zhang, Yu Zhou, Jianan Ji, Jinchen Jiang, Zepeng Zhao, Ziruo Xiao, Zihao Ye, Yingyi Huang, Ruihang Lai, Hongyi Jin, Bohan Hou, Mengdi Wu, Yixin Dong, Anthony Yip, Zihao Ye, Songting Wang, Wenqin Yang, Xupeng Miao, Tianqi Chen, Zhihao Jia arxiv

We introduce Mirage Persistent Kernel (MPK), the first compiler and runtime system that automatically transforms multi-GPU model inference into a single high-performance mega-kernel. MPK introduces an SM-level graph representation that captures data dependencies at the granularity of individual streaming multiprocessors (SMs), enabling cross-operator software pipelining, \rev{fine-grained overlap of computation and communication, and other optimizations that are infeasible under the conventional kernel-per-operator execution model}. The MPK compiler lowers tensor programs into optimized SM-level task graphs and generates fast CUDA implementations for each task, while the MPK in-kernel parallel runtime executes these tasks within a single persistent mega-kernel using decentralized scheduling across SMs. Together, these components provide end-to-end kernel fusion with minimal developer effort, while preserving the flexibility of existing programming models. Our evaluation shows that MPK significantly outperforms existing kernel-per-operator LLM serving systems, achieving up to 1.7$\times$ lower end-to-end inference latency and pushing LLM inference performance close to the limits of the underlying hardware. MPK is publicly available at https://github.com/mirage-project/mirage.

📄 PDF Abstract BibTeX arXiv:2512.22219

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Hidet: Task-Mapping Programming Paradigm for Deep Learning Tensor Programs

2022-10-18 · Yaoyao Ding, Cody Hao Yu, Bojian Zheng, Yizhi Liu 외

As deep learning models nowadays are widely adopted by both cloud services and edge devices, reducing the latency of deep learning model inferences becomes crucial to provide efficient model serving. However, it is chall…

Deep LearningScheduling

DVM: A Bytecode Virtual Machine Approach for Dynamic Tensor Computation

2026-03-25 · Jingzhi Fang, Xiong Gao, Renwei Zhang, Zichun Ye 외 arxiv

Dynamism is common in AI computation, e.g., the dynamic tensor shapes and the dynamic control flows in models. Due to the long compilation time, existing runtime compilation damages the model efficiency, while the offlin…

CHET: Compiler and Runtime for Homomorphic Evaluation of Tensor Programs

2018-10-01 · Roshan Dathathri, Olli Saarikivi, Hao Chen, Kim Laine 외

Fully Homomorphic Encryption (FHE) refers to a set of encryption schemes that allow computations to be applied directly on encrypted data without requiring a secret key. This enables novel application scenarios where a c…

Event Tensor: A Unified Abstraction for Compiling Dynamic Megakernel

2026-04-14 · Hongyi Jin, Bohan Hou, Guanjie Wang, Ruihang Lai 외 arxiv

Modern GPU workloads, especially large language model (LLM) inference, suffer from kernel launch overheads and coarse synchronization that limit inter-kernel parallelism. Recent megakernel techniques fuse multiple operat…

WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models

2023-10-24 · Chenyuan Yang, Yinlin Deng, Runyu Lu, Jiayi Yao 외

Compiler correctness is crucial, as miscompilation can falsify program behaviors, leading to serious consequences. Fuzzing has been studied to uncover compiler defects. However, compiler fuzzing remains challenging: Exis…

Code GenerationCompiler Optimization