paper-with-me

홈 › Papers

The CoRa Tensor Compiler: Compilation for Ragged Tensors with Minimal Padding

2021-10-19 · Pratik Fegade, Tianqi Chen, Phillip B. Gibbons, Todd C. Mowry

There is often variation in the shape and size of input data used for deep learning. In many cases, such data can be represented using tensors with non-uniform shapes, or ragged tensors. Due to limited and non-portable support for efficient execution on ragged tensors, current deep learning frameworks generally use techniques such as padding and masking to make the data shapes uniform and then offload the computations to optimized kernels for dense tensor algebra. Such techniques can, however, lead to a lot of wasted computation and therefore, a loss in performance. This paper presents CoRa, a tensor compiler that allows users to easily generate efficient code for ragged tensor operators targeting a wide range of CPUs and GPUs. Evaluating CoRa on a variety of operators on ragged tensors as well as on an encoder layer of the transformer model, we find that CoRa (i)performs competitively with hand-optimized implementations of the operators and the transformer encoder and (ii) achieves, over PyTorch, a 1.6X geomean speedup for the encoder on an Nvidia GPU and a 1.86X geomean speedup for the multi-head attention module used in transformers on an ARM CPU.

📄 PDF Abstract BibTeX arXiv:2110.10221

Code (0)

등록된 구현이 없습니다.

Tasks

CPUGPUtensor algebra

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.

Similar Papers 제목 키워드 기반

VTC: DNN Compilation with Virtual Tensors for Data Movement Elimination

2026-02-11 · Muyan Hu, Ahan Gupta, Jiachen Yuan, Vima Gupta 외 arxiv

With the widening gap between compute and memory operation latencies, data movement optimizations have become increasingly important for DNN compilation. Current optimizations such as layout transformations and operator …

Provenance Tracking in AI Compilers through the Lens of Coalgebra

2026-06-09 · Zilu Tian, Liying Liu arxiv

AI compilers aggressively rewrite computation graphs through normalization, lowering, and optimization, making it difficult to track the provenance of tensors and operators across compilation. Reliable provenance is esse…

SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning

2022-07-11 · Zihao Ye, Ruihang Lai, Junru Shao, Tianqi Chen 외

Sparse tensors are rapidly becoming critical components of modern deep learning workloads. However, developing high-performance sparse operators can be difficult and tedious, and existing vendor libraries cannot satisfy …

Deep Learning

Towards a high-performance AI compiler with upstream MLIR

2024-04-15 · Renato Golin, Lorenzo Chelini, Adam Siemieniuk, Kavitha Madhu 외

This work proposes a compilation flow using open-source compiler passes to build a framework to achieve ninja performance from a generic linear algebra high-level abstraction. We demonstrate this flow with a proof-of-con…

FTuner: A Fast Dynamic Shape Tensors Program Auto-Tuner for Deep Learning Compilers

2024-07-31 · Pengyu Mu, Linquan Wei, Yi Liu, Rui Wang

Many artificial intelligence models process input data of different lengths and resolutions, making the shape of the tensors dynamic. The performance of these models depends on the shape of the tensors, which makes it di…