activity
20162023
most citedFormat Abstraction for Sparse Tensor Algebra Compilers

124 citations · 344 across the 22 of their papers we have counts for

collaborators

23 papers

cs.PL2023

AskIt: Unified Programming Interface for Programming with Large Language Models

Katsumi Okuda, Saman Amarasinghe

Large Language Models (LLMs) exhibit a unique phenomenon known as emergent abilities, demonstrating adeptness across numerous tasks, from text summarization to code generation. Whi…

cs.MS2021★ 1 cited

Dynamic Sparse Tensor Algebra Compilation

Stephen Chou, Saman Amarasinghe

This paper shows how to generate efficient tensor algebra code that compute on dynamic sparse tensors, which have sparsity structures that evolve over time. We propose a language f…

cs.MS2021

An Asymptotic Cost Model for Autoscheduling Sparse Tensor Programs

Willow Ahrens, Fredrik Kjolstad, Saman Amarasinghe

While loop reordering and fusion can make big impacts on the constant-factor performance of dense tensor programs, the effects on sparse tensor programs are asymptotic, often leadi…

cs.MS2021★ 2 cited

An Attempt to Generate Code for Symmetric Tensor Computations

Jessica Shi, Stephen Chou, Fredrik Kjolstad +1

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 der…

hep-lat2021★ 49 cited

A variational study of two-nucleon systems with lattice QCD

Saman Amarasinghe, Riyadh Baghdadi, Zohreh Davoudi +6

The low-energy spectrum and scattering of two-nucleon systems are studied with lattice quantum chromodynamics using a variational approach. A wide range of interpolating operators…

cs.DC2021

Compilation Techniques for Graph Algorithms on GPUs

Ajay Brahmakshatriya, Yunming Zhang, Changwan Hong +3

The performance of graph programs depends highly on the algorithm, the size and structure of the input graphs, as well as the features of the underlying hardware. No single set of…