paperbot · PL 论文追踪

全部论文 待读 收藏

P2 SLAWS: Spatial Locality Analysis and Workload Orchestration for Sparse Matrix Multiplication

SLAWS:稀疏矩阵乘法的空间局部性分析与工作负载编排
ASPLOS Proceedings of the 31st ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 22026匹配度 1/10 · 该论文研究 SpMSpM 的硬件加速器体系结构与负载编排,属于体系结构/稀疏计算方向,与用户关注的 PL/AI、程序静态分析、浮点程序分析、贝叶斯程序分析及 LLM 交叉均无直接关联;仅“分析”一词表面相近。引用 0 inbox
Guoyu Li, Zheng Guan, Beichen Zhang, Jun Yu, Kun Wang
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出通用 SpMSpM 加速器 Slaws,通过稀疏模式分析与负载编排提升数据复用和计算效率。

SLAWS 针对 SpMSpM 中非零元素分布高度不均导致的效率问题,以及专用加速器牺牲通用性和数据复用机会的不足,提出一种高效通用加速器架构。它通过分析不同稀疏模式并利用多种数据复用机会来加速计算。针对左乘数,采用 Pass-Aware 策略分析矩阵结构、识别独特稀疏模式并优化访存;针对右乘数,采用 Shuffle-Compare 策略,通过每周期近似 top-K 输出动态平衡计算单元间的乘法工作量,减少空闲时间。实验表明,SLAWS 相较两种最先进加速器取得 1.46× 和 1.43× 加速,相较 GPU 取得 1.55× 加速。

问题
SpMSpM 因非零元素分布高度可变而难以高效计算,现有专用稀疏加速器通用性不足且未充分挖掘数据复用。
方法
提出通用加速器 Slaws,对左乘数用 Pass-Aware 策略分析稀疏模式并优化访存,对右乘数用 Shuffle-Compare 策略近似 top-K 输出以动态均衡计算负载。
评估
实现 Slaws 并与两种 SOTA 稀疏矩阵加速器及 GPU 对比,获得 1.46×/1.43× 和 1.55× 加速。
原文摘要(Abstract)

Sparse matrix-sparse matrix multiplication (SpMSpM) is widely used in modern scientific applications, including high-performance computing, linear algebra, and graph processing. However, the highly variable distribution of nonzero elements in these matrices presents a significant challenge to computational efficiency. While existing sparse matrix accelerators often rely on specialized architectures tailored for specific dataflow, these designs sacrifice generality and fail to fully exploit potential data reuse opportunities. In this paper, we propose Slaws, an efficient and general-purpose accelerator architecture for SpMSpM. This design accelerates computation by analyzing distinct sparsity patterns and leveraging various data reuse opportunities. We introduce two key strategies to address the challenges of different matrix operand positions. For the left multiplicand, we present a Pass-Aware strategy to analyze matrix structures, identify unique sparsity patterns, and optimize memory access. For the right multiplicand, we introduce a Shuffle-Compare strategy to dynamically balance the multiplication workload across computing units. By approximating the top-K outputs per cycle, this method minimizes idle time and ensures a balanced workload distribution. We implement both strategies in Slaws and conduct extensive experiments. The results show that Slaws achieves 1.46× and 1.43× speedups over two state-of-the-art accelerators, and 1.55× speedup over GPU.

链接与引用

DOI 原文 · PDF(开放获取) · DBLP

BibTeX
@inproceedings{LiGZYW26,
  title = {SLAWS: Spatial Locality Analysis and Workload Orchestration for Sparse Matrix Multiplication},
  author = {Guoyu Li and Zheng Guan and Beichen Zhang and Jun Yu and Kun Wang},
  booktitle = {ASPLOS},
  year = {2026},
  doi = {10.1145/3779212.3790222}
}