paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Hopps: Leveraging Sparsity to Accelerate Automata Processing

Hopps:利用稀疏性加速自动机处理
ASPLOS Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 32025匹配度 1/10 · 该论文聚焦自动机处理的硬件加速器与稀疏表示,属于体系结构/硬件加速方向,与用户关注的 PL 与 AI/LLM 交叉、静态分析、浮点程序分析、贝叶斯程序分析均无直接关系。引用 1 inbox
Xingran Du, Joel S. Emer, Daniel Sanchez
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:首个利用稀疏表示的自动机处理加速器 Hopps,混合压缩与未压缩单元,等面积下显著超越 SOTA。

自动机处理(AP)是数据分析与科学计算的关键内核,但现有加速器多以位集无压缩存储自动机图,依赖交叉开关获得高并行,对稀疏图效率低。Hopps 是首个利用稀疏数据表示的 AP 加速器:它混合两类处理单元,一类无压缩、吞吐高但空间效率差,另一类采用压缩稀疏表示、空间高效但吞吐较低且波动。为发挥优势,论文提出自动机映射算法,将大部分工作分给高吞吐单元,同时把大量状态留在空间高效单元,并放宽交叉开关设计约束,允许使用大量较小交叉开关。在 AutomataZoo 上,等面积下 Hopps 相对 Impala 和 SpAP 的几何平均加速分别为 2.5 倍和 2.2 倍。

问题
现有自动机处理加速器多采用无压缩位集存储自动机图并依赖交叉开关,对稀疏图空间与能效低,未充分利用 AP 工作负载的稀疏性。
方法
提出 Hopps 混合加速器,结合无压缩高吞吐单元与压缩稀疏空间高效单元,并设计自动机映射算法将多数工作导向高吞吐单元、大量状态留在压缩单元。
评估
在 AutomataZoo 基准上,与等面积下的 SOTA Impala 和 SpAP 对比,几何平均加速分别为 2.5 倍和 2.2 倍。
原文摘要(Abstract)

Automata processing (AP) is a key kernel in data analytics and scientific computing. AP workloads process a stream of symbols with many automata (FSMs) in parallel, e.g., pattern-matching network traffic against many malicious strings. The need for high-performance AP has sparked the design of specialized accelerators. But prior AP accelerators are inefficient: AP workloads have substantial sparsity, but accelerators exploit no or limited sparsity. Specifically, each AP workload can be expressed as the concurrent traversal of all automata, which are encoded as graphs. But state-of-the-art accelerators store these graphs uncompressed, using bitsets. This allows the use of specialized memory crossbars that provide high parallelism and efficiency when graphs are dense. But many graphs are highly sparse, making crossbar-based accelerators inefficient. We present Hopps, the first automata processing accelerator that exploits sparse data representations. Hopps combines two types of processing units: one represents data uncompressed, which achieves high throughput but is space-inefficient, while the other uses a compressed-sparse representation, which achieves high space efficiency but lower and more variable throughput. To use Hopps well, we present a novel automata mapping algorithm that maps most work to high-throughput units, while keeping a large fraction of state in space-efficient units. Hopps's hybrid design relaxes several constraints in crossbar-based designs, allowing for more efficient high-throughput units (e.g., by using a large number of smaller crossbars). Thus, by making the uncommon case cheap, Hopps makes the common case even faster. We evaluate Hopps on AutomataZoo benchmarks. Hopps outperforms prior state-of-the-art accelerators Impala and SpAP by gmean 2.5x and 2.2x when using equal area.

链接与引用

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

BibTeX
@inproceedings{DuE025,
  title = {Hopps: Leveraging Sparsity to Accelerate Automata Processing},
  author = {Xingran Du and Joel S. Emer and Daniel Sanchez},
  booktitle = {ASPLOS},
  year = {2025},
  doi = {10.1145/3676642.3736126}
}