2 citations · 2 across the 5 of their papers we have counts for
5 papers
Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
Benjamin Brock, Willow Ahrens, Hameer Abbasi +6
Sparse matrices and tensors are ubiquitous throughout multiple subfields of computing. The widespread usage of sparse data has inspired many in-memory and on-disk storage formats,…
Interface for Sparse Linear Algebra Operations
Ahmad Abdelfattah, Willow Ahrens, Hartwig Anzt +32
The standardization of an interface for dense linear algebra operations in the BLAS standard has enabled interoperability between different linear algebra libraries, thereby boosti…
Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication
Willow Ahrens
Graph partitioning schedules parallel calculations like sparse matrix-vector multiply (SpMV). We consider contiguous partitions, where the rows (or columns) of a sparse matrix…
On Optimal Partitioning For Sparse Matrices In Variable Block Row Format
Willow Ahrens, Erik G. Boman
The Variable Block Row (VBR) format is an influential blocked sparse matrix format designed for matrices with shared sparsity structure between adjacent rows and columns. VBR group…
LATE Ain'T Earley: A Faster Parallel Earley Parser
Willow Ahrens, John Feser, Robin Hui
We present the LATE algorithm, an asynchronous variant of the Earley algorithm for parsing context-free grammars. The Earley algorithm is naturally task-based, but is difficult to…