TPU-MLIR: A Compiler For TPU Using MLIR

Authors: Pengchao Hu, Man Lu, Lei Wang, Guoyue Jiang

A way to design AI Compiler for ASIC chips by MLIR

Results of the summarizing process for the arXiv paper: 2210.15016v1

  • Comprehensive Summary
  • Key points
  • Layman's Summary
  • Blog article
The development of domain-specific compilers can be a costly and time-consuming process. Multi-level intermediate representations (MLIR) offer a promising solution by providing a reusable and extensible compiler infrastructure. In this paper, the authors present TPU-MLIR, an end-to-end compiler based on MLIR that deploys pre-trained neural network (NN) models to a custom ASIC called a Tensor Processing Unit (TPU). To implement its functionality, TPU-MLIR defines two new dialects: 1. a Tensor operation (TOP) dialect that encodes the deep learning graph semantics and is independent of the deep learning framework; and 2. a TPU kernel dialect to provide standard kernel computation on TPU. The NN model is translated into the TOP dialect and then lowered to the TPU dialect for different TPUs according to their chip configuration. The authors demonstrate how to use the MLIR pass pipeline to organize and perform optimization on TPU to generate machine code. They also present a verification procedure to ensure the correctness of each transform stage. Overall, TPU-MLIR offers an efficient solution for designing AI compilers for ASIC chips using MLIR. With its ability to reduce costs and improve performance, it has significant potential in advancing the field of deep learning hardware acceleration.
AI-generated keywords: TPU-MLIR MLIR TOP dialect TPU dialect ASIC

AI-generated Key Points

  • Developing domain-specific compilers can be costly and time-consuming
  • Multi-level intermediate representations (MLIR) offer a reusable and extensible compiler infrastructure
  • TPU-MLIR is an end-to-end compiler based on MLIR that deploys pre-trained neural network models to a custom ASIC called a Tensor Processing Unit (TPU)
  • TPU-MLIR defines two new dialects: Tensor operation (TOP) dialect and TPU kernel dialect
  • NN model is translated into the TOP dialect and then lowered to the TPU dialect for different TPUs according to their chip configuration
  • MLIR pass pipeline is used to organize and perform optimization on TPU to generate machine code
  • Verification procedure ensures correctness of each transform stage
  • TPU-MLIR offers an efficient solution for designing AI compilers for ASIC chips using MLIR, reducing costs and improving performance.
Also access our AI generated: Comprehensive summary, Lay summary, Blog-like article; or ask questions about this paper to our AI assistant.

Abstract: Multi-level intermediate representations (MLIR) show great promise for reducing the cost of building domain-specific compilers by providing a reusable and extensible compiler infrastructure. This work presents TPU-MLIR, an end-to-end compiler based on MLIR that deploys pre-trained neural network (NN) models to a custom ASIC called a Tensor Processing Unit (TPU). TPU-MLIR defines two new dialects to implement its functionality: 1. a Tensor operation (TOP) dialect that encodes the deep learning graph semantics and independent of the deep learning framework and 2. a TPU kernel dialect to provide a standard kernel computation on TPU. A NN model is translated to the TOP dialect and then lowered to the TPU dialect for different TPUs according to the chip's configuration. We demonstrate how to use the MLIR pass pipeline to organize and perform optimization on TPU to generate machine code. The paper also presents a verification procedure to ensure the correctness of each transform stage.

Submitted to arXiv on 23 Oct. 2022

Tools for this paper

Explain it differently 3 free rewrites left today
Export BibTeX · RIS (Zotero, Mendeley, EndNote) · Markdown (Notion, Obsidian) · Premium
Citation alerts Premium
Journal club Slides to present it Premium
For journalists Press kit and hype check Premium

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Assess the quality of the AI-generated content by voting

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.