An Attempt to Generate Code for Symmetric Tensor Computations

10/01/2021
by   Jessica Shi, et al.
0

This document describes an attempt to develop a compiler-based approach for computations with symmetric tensors. Given a computation and the symmetries of its input tensors, we derive formulas for random access under a storage scheme that eliminates redundancies; construct intermediate representations to describe the loop structure; and translate this information, using the taco tensor algebra compiler, into code. While we achieve a framework for reasoning about a fairly general class of symmetric computations, the resulting code is not performant when the symmetries are misaligned.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/22/2020

Symmetric Tensor Decompositions On Varieties

This paper discusses the problem of symmetric tensor decomposition on a ...
research
08/25/2022

Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-Iteration

This paper presents a code generator for sparse tensor contraction compu...
research
02/09/2022

Compiler Support for Sparse Tensor Computations in MLIR

Sparse tensors arise in problems in science, engineering, machine learni...
research
10/19/2021

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

There is often variation in the shape and size of input data used for de...
research
02/19/2018

Compiling Diderot: From Tensor Calculus to C

Diderot is a parallel domain-specific language for analysis and visualiz...
research
10/15/2022

Approximate Graph Colouring and Crystals

We show that approximate graph colouring is not solved by any level of t...
research
03/07/2016

TTC: A high-performance Compiler for Tensor Transpositions

We present TTC, an open-source parallel compiler for multidimensional te...

Please sign up or login with your details

Forgot password? Click here to reset