Abstract
A domain-specific language with a tensor notation close to the mathematics of deep learning; a Just-In-Time optimizing compiler based on the polyhedral framework; carefully coordinated linear optimization and evolutionary algorithms to synthesize high-performance CUDA kernels; the transparent integration of the flow into PyTorch and Caffe2, providing the fully automatic synthesis of high- performance GPU kernels from simple tensor algebra. Deep learning frameworks automate the deployment, distribution, synchronization, memory allocation, and hardware acceleration of models represented as graphs of computational operators. These operators wrap high-performance libraries such as cuDNN or NNPACK. When the computation does not match any predefined library call, custom operators must be implemented, often at high engineering cost and performance penalty, limiting the pace of innovation. To address this productivity gap, we propose and evaluate: (1) a domain-specific language with a tensor notation close to the mathematics of deep learning; (2) a Just-In-Time optimizing compiler based on the polyhedral framework; (3) carefully coordinated linear optimization and evolutionary algorithms to synthesize high-performance CUDA kernels; (4) the transparent integration of our flow into PyTorch and Caffe2, providing the fully automatic synthesis of high-performance GPU kernels from simple tensor algebra. The performance is comparable to, and often exceeds the performance of, highly tuned libraries.
Figure
figure 2
figure 3
figure 4
figure 8
figure 9
figure 10
Table
table 1
table 2
