research
∙
08/29/2023
AskIt: Unified Programming Interface for Programming with Large Language Models
In the evolving landscape of software development, Large Language Models...
share
research
∙
09/08/2022
Looplets: A Language For Structured Coiteration
Real world arrays often contain underlying structure, such as sparsity, ...
research
∙
12/02/2021
Dynamic Sparse Tensor Algebra Compilation
This paper shows how to generate efficient tensor algebra code that comp...
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
∙
10/01/2021
An Attempt to Generate Code for Symmetric Tensor Computations
This document describes an attempt to develop a compiler-based approach ...
research
∙
04/11/2021
A Deep Learning Based Cost Model for Automatic Code Optimization
Enabling compilers to automatically optimize code has been a longstandin...
research
∙
12/14/2020
Compilation Techniques for Graph Algorithms on GPUs
The performance of graph programs depends highly on the algorithm, the s...
research
∙
05/21/2020
Sparse Tensor Transpositions
We present a new algorithm for transposing sparse tensors called Quesadi...
research
∙
05/07/2020
TIRAMISU: A Polyhedral Compiler for Dense and Sparse Deep Learning
In this paper, we demonstrate a compiler that can optimize sparse and re...
research
∙
01/08/2020
Automatic Generation of Efficient Sparse Tensor Format Conversion Routines
This paper shows how to generate code that efficiently converts sparse t...
research
∙
12/28/2019
A Unified Iteration Space Transformation Framework for Sparse and Dense Tensor Algebra
We address the problem of optimizing mixed sparse and dense tensor algeb...
research
∙
11/17/2019
Optimizing Ordered Graph Algorithms with GraphIt
Many graph problems can be solved using ordered parallel graph algorithm...
research
∙
11/17/2019
PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms
Many graph problems can be solved using ordered parallel graph algorithm...
research
∙
02/07/2019
Revec: Program Rejuvenation through Revectorization
Modern microprocessors are equipped with Single Instruction Multiple Dat...
research
∙
08/21/2018
Ithemal: Accurate, Portable and Fast Basic Block Throughput Estimation using Deep Neural Networks
Statically estimating the number of processor clock cycles it takes to e...
research
∙
07/04/2018
Cimple: Instruction and Memory Level Parallelism
Modern out-of-order processors have increased capacity to exploit instru...
research
∙
05/02/2018
GraphIt - A High-Performance DSL for Graph Analytics
The performance bottlenecks of graph applications depend not only on the...
research
∙
04/27/2018
Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code
This paper introduces Tiramisu, a polyhedral framework designed to gener...
research
∙
04/27/2018
Tiramisu: A Code Optimization Framework for High Performance Systems
This paper introduces Tiramisu, an optimization framework designed to ge...
research
∙
04/23/2018
goSLP: Globally Optimized Superword Level Parallelism Framework
Modern microprocessors are equipped with single instruction multiple dat...
research
∙
04/23/2018
Format Abstraction for Sparse Tensor Algebra Compilers
This paper shows how to build a sparse tensor algebra compiler that is a...
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
∙
03/20/2018
The Three Pillars of Machine Programming
In this position paper, we describe our vision of the future of machine ...
research
∙
03/20/2018
The Three Pillars of Machine-Based Programming
In this position paper, we describe our vision of the future of machine-...
research
∙
02/28/2018
Sparse Tensor Algebra Optimizations with Workspaces
This paper shows how to optimize sparse tensor algebraic expressions by ...
research
∙
02/28/2018
Automatic Generation of Sparse Tensor Kernels with Workspaces
Recent advances in compiler theory describe how to compile sparse tensor...
research
∙
02/28/2018
Technical Report about Tiramisu: a Three-Layered Abstraction for Hiding Hardware Complexity from DSL Compilers
High-performance DSL developers work hard to take advantage of modern ha...
research
∙
09/14/2017