A Learned Performance Model for Tensor Processing Units
원문 초록
Accurate hardware performance models are critical to efficient code generation. They can be used by compilers to make heuristic decisions, by superoptimizers as a minimization objective, or by autotuners to find an optimal configuration for a specific program. However, they are difficult to develop because contemporary processors are complex, and the recent proliferation of deep learning accelerators has increased the development burden. We demonstrate a method of learning performance models from a corpus of tensor computation graph programs for Tensor Processing Unit (TPU) instances. We show that our learned model outperforms a heavily-optimized analytical performance model on two tasks -- tile-size selection and operator fusion -- and that it helps an autotuner discover faster programs in a setting where access to TPUs is limited or expensive.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Code Graph Model (CGM): A Graph-Integrated Large Language Model for Repository-Level Software Engineering Tasks
Generalizing Large Language Model Usability Across Resource-Constrained
Making Language Model a Hierarchical Classifier and Generator
The Devil behind the mask: An emergent safety vulnerability of Diffusion LLMs
Implementing Adaptations for Vision AutoRegressive Model
Graph World Model
토론
이 논문과 연결된 포럼 글이 아직 없습니다.