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...
share
research
∙
07/31/2020
Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms
We study partitioning to parallelize multiplication of one or more dense...
research
∙
05/25/2020
On Optimal Partitioning For Sparse Matrices In Variable Block Row Format
The Variable Block Row (VBR) format is an influential blocked sparse mat...
research
∙
05/21/2020
Sparse Tensor Transpositions
We present a new algorithm for transposing sparse tensors called Quesadi...
research
∙
07/16/2018
LATE Ain'T Earley: A Faster Parallel Earley Parser
We present the LATE algorithm, an asynchronous variant of the Earley alg...
research
∙
02/28/2018