Stardust: Compiling Sparse Tensor Algebra to a Reconfigurable Dataflow Architecture

11/07/2022
by   Olivia Hsu, et al.
0

We introduce Stardust, a compiler that compiles sparse tensor algebra to reconfigurable dataflow architectures (RDAs). Stardust introduces new user-provided data representation and scheduling language constructs for mapping to resource-constrained accelerated architectures. Stardust uses the information provided by these constructs to determine on-chip memory placement and to lower to the Capstan RDA through a parallel-patterns rewrite system that targets the Spatial programming model. The Stardust compiler is implemented as a new compilation path inside the TACO open-source system. Using cycle-accurate simulation, we demonstrate that Stardust can generate more Capstan tensor operations than its authors had implemented and that it results in 138× better performance than generated CPU kernels and 41× better performance than generated GPU kernels.

READ FULL TEXT

page 2

page 3

page 5

page 8

research
02/09/2021

A High-Performance Sparse Tensor Algebra Compiler in Multi-Level IR

Tensor algebra is widely used in many applications, such as scientific c...
research
02/28/2018

Automatic Generation of Sparse Tensor Kernels with Workspaces

Recent advances in compiler theory describe how to compile sparse tensor...
research
04/23/2018

Unified Sparse Formats for Tensor Algebra Compilers

This paper shows how to build a sparse tensor algebra compiler that is a...
research
10/18/2021

Can Fortran's 'do concurrent' replace directives for accelerated computing?

Recently, there has been growing interest in using standard language con...
research
09/07/2022

Sgap: Towards Efficient Sparse Tensor Algebra Compilation for GPU

Sparse compiler is a promising solution for sparse tensor algebra optimi...
research
11/29/2021

An Asymptotic Cost Model for Autoscheduling Sparse Tensor Programs

While loop reordering and fusion can make big impacts on the constant-fa...
research
08/26/2022

An Open-Source P416 Compiler Backend for Reconfigurable Match-Action Table Switches

The P4 language has become the dominant choice for programming the recon...

Please sign up or login with your details

Forgot password? Click here to reset