The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
Abstract
This work presents MLIR, a novel approach to building reusable and extensible compiler infrastructure. MLIR addresses software fragmentation, compilation for heterogeneous hardware, significantly reducing the cost of building domain specific compilers, and connecting existing compilers together. MLIR facilitates the design and implementation of code generators, translators and optimizers at different levels of abstraction and across application domains, hardware targets and execution environments. The contribution of this work includes (1) discussion of MLIR as a research artifact, built for extension and evolution, while identifying the challenges and opportunities posed by this novel design, semantics, optimization specification, system, and engineering. (2) evaluation of MLIR as a generalized infrastructure that reduces the cost of building compilers-describing diverse use-cases to show research and educational opportunities for future programming languages, compilers, execution environments, and computer architecture. The paper also presents the rationale for MLIR, its original design principles, structures and semantics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Code generation in the polyhedral model is easier than you think
Bastoul, C. (2004) · Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004. · doi:10.1109/pact.2004.1342537 · Cited by 447
A practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375595 · Cited by 248
Self-citation
Research works printed but not linked: 57
- 0, The OpenMPAPIspecification for parallel programming
- 10.1145/3178372.3179501 · doi:10.1145/3178372.3179501
- 10.1145/3372266 · DOI
- 10.1142/S0129626412500107 · DOI · Paper page
- 10.1145/2597652.2597673 · DOI
- 10.1007/978-3-642-16310-4_2 · DOI
- 10.1016/j.scico.2007.11.003 · DOI · Paper page
- garcia, 2009, Lattice regression, Advances in Neural Information Processing Systems 22, 594
- schweitz, 2019, An MLIR dialect for high-level optimization of fortran, LLVM Developers' Meeting
- 10.1145/2400682.2400713 · DOI · Paper page
- 10.1007/978-3-642-15582-6_49 · DOI · Paper page
- vasilache, 2019, The next 700 accelerated layers: From mathematical expressions of network computation graphs to accelerated GPU kernels, automatically, ACM Trans Archit Code Optim, 16, 38:1, 10.1145/3355606 · DOI
- lindholm, 1999, Java Virtual Machine Specification
- 10.1109/CGO.2004.1281665 · DOI · Paper page
- 10.1145/278283.278285 · DOI · Paper page
- 10.1145/27633.28055 · doi:10.1145/27633.28055
- 10.1145/202529.202534 · doi:10.1145/202529.202534
- 2017, XLA - TensorFlow compiled
- abadi, 2015, TensorFlow Large-Scale Machine Learning on Heterogeneous Systems
- 10.1007/s10766-006-0012-3 · DOI
- 10.1007/BF01379404 · DOI · Paper page
- 10.1145/3150211 · doi:10.1145/3150211
- 10.1007/978-3-642-19595-2_10 · DOI
- 0, Onnx Open neural network exchange
- baghdadi, 2008, Tiramisu: A polyhedral compiler for expressing fast and portable code, Proceedings of the 2019 IEEE/ACM International Symposium on Code Generation and Optimization ser CGO 2019, 193
- 10.1145/3211346.3211354 · DOI
- zerrell, 2019, Stripe: Tensor compilation via the nested polyhedral model, CoRR, abs 1903 649s
- 10.1145/2694344.2694364 · DOI
- 10.1016/j.scico.2005.10.013 · DOI
- 10.1145/2854038.2854048 · DOI
- 10.1145/201059.201061 · doi:10.1145/201059.201061
- 10.1007/BFb0054170 · DOI · Paper page
- 10.1177/1094342009106195 · doi:10.1177/1094342009106195
- 10.1145/358438.349314 · doi:10.1145/358438.349314
- 10.1145/1328438.1328444 · doi:10.1145/1328438.1328444
- 10.1145/1542476.1542512 · doi:10.1145/1542476.1542512
- 10.1145/2491956.2462173 · DOI
- schommer, 2018, Embedded Program Annotations for WCET Analysis, WCET 2018 18th International Workshop on Worst-Case Execution Time Analysis, 63
- 10.1145/3377555.3377897 · doi:10.1145/3377555.3377897
- 10.1145/1749608.1749612 · DOI · Paper page
- 0, TableGen - LLVM 10 Documentation
- 10.1145/178243.178258 · doi:10.1145/178243.178258
- 10.1145/115372.115320 · DOI · Paper page
- 10.1145/570886.570887 · doi:10.1145/570886.570887
- 10.1109/HPCA.1998.650566 · doi:10.1109/hpca.1998.650566
- 10.1145/3155284.3018758 · doi:10.1145/3155284.3018758
- 10.1145/2833157.2833158 · doi:10.1145/2833157.2833158
- chen, 2018, TVM: An automated end-to-end optimizing compiler for deep learning, 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), 578
- 2001, Open64 Developers, Open64 Compiler Tools
- 10.1145/2584665 · doi:10.1145/2584665
- 10.1145/2184319.2184345 · DOI
- rotem, 2018, Glow Graph lowering compiler techniques for neural networks
- 10.1002/spe.4380250705 · DOI · Paper page
- 0, SyCL C++ single-sourceheterogeneous programming for OpenCL
- 0, The OpenACCTM Application Programming Interface
- 10.1145/1869459.1869470 · doi:10.1145/1869459.1869470
- 10.1145/2228360.2228411 · doi:10.1145/2228360.2228411
Cited by
Ansel, J., Yang, E., He, H., Gimelshein, N., Jain, A., Voznesensky, M., Bao, B., Bell, P., Berard, D., Burovski, E., et al. (2024) · Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2 · doi:10.1145/3620665.3640366 · Cited by 737
Scherer, M., Macan, L., Jung, V. J. B., Wiese, P., Bompani, L., Burrello, A., Conti, F., & Benini, L. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3443718 · Cited by 26
Kimi K3: Open Frontier Intelligence
Kimi Team, Bai, T., Bai, Y., Bao, Y., C., M., Cai, J., Cai, X., Cao, P., Cao, Y., Chai, Z., et al. (2026) · arXiv · doi:10.48550/arxiv.2607.24653
“GPU compiler development Kimi K3 developed MiniTriton 5 , a compact Triton-like [124] compiler with a custom tile-level Python frontend and layout system, a lightweight warp-level MLIR [65] annotation and optimization layer, and a Parallel Thread Execution (PTX) code-generation pipeline.”
Metadata
- Authors
- Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O.
- Venue
- 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)
- Publisher
- IEEE
- Published
- 2021-02-27
- Pages
- 2-14
- OpenAlex
- W3122286897
- Cited by
- 541
- References
- 2
- FWCI
- 52.99
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: MLIR: Scaling Compiler Infrastructure for Domain Specific Computation. https://app.cochat.ai/papers/10.1109/cgo51591.2021.9370308
- The paper
- Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2021). MLIR: Scaling Compiler Infrastructure for Domain Specific Computation. 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO). https://doi.org/10.1109/cgo51591.2021.9370308
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.