5 papers
The Einsum-Enabled Design Space for Graph Algorithms: A BFS Case Study
Toluwanimi O. Odemuyiwa, Serban D. Porumbescu, Muhammad Osama +2
We propose a principled approach to reasoning about various graph algorithm implementations. We leverage the extended general Einsum notation (EDGE) which allows us to factor compl…
Campaign Diagrams: Visualizing the March Through the Phases of a Workload
Toluwanimi O. Odemuyiwa, John D. Owens, Michael Pellauer +1
We present campaign diagrams, a visualization technique for phase-level analysis of resource utilization and bottlenecks in modern workloads. Existing tools have a trade-off: roofl…
Mambalaya: Einsum-Based Fusion Optimizations on State-Space Models
Toluwanimi O. Odemuyiwa, John D. Owens, Joel S. Emer +1
Mamba is an emerging, complex workload with various short-range and long-range dependencies, nonlinearities, and elementwise computations that are unable to run at near-peak speeds…
BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding
Jiayi Yuan, Cameron Shinn, Kai Xu +19
The growing demand for long-context inference capabilities in Large Language Models (LLMs) has intensified the computational and memory bottlenecks inherent to the self-attention m…
The Sparsity Roofline: Understanding the Hardware Limits of Sparse Neural Networks
Cameron Shinn, Collin McCarthy, Saurav Muralidharan +2
We introduce the Sparsity Roofline, a visual performance model for evaluating sparsity in neural networks. The Sparsity Roofline jointly models network accuracy, sparsity, and theo…