paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs

面向 CPU 上 SpMV 的 UZP 稀疏格式的模块化构建与优化
PLDI 9(PLDI)2025匹配度 1/10 · 该论文研究稀疏矩阵格式 UZP 与 SpMV 性能优化,属于编译/代码生成和高性能数值计算方向;与用户关注的静态分析、LLM/Agent 交叉、浮点程序分析或贝叶斯程序分析均无直接关系。引用 1 inbox
Alonso Rodríguez-Iglesias, Santoshkumar T. Tongli, Emily Tucker, Louis-Noël Pouchet, Gabriel Rodríguez, Juan Touriño
crossref: 2026-09-10

AI 速览

一句话:提出基于整数多面体并集的 UZP 稀疏格式,统一 CSR/COO 等格式并支持模块化调优 SpMV 性能。

稀疏矩阵计算中,CSR、COO 等通用格式难以充分利用特定稀疏模式,而专用格式常缺乏灵活性与互操作性。本文提出 UZP,一种基于整数点多面体集合的稀疏格式:将稀疏结构表示为若干整数多面体的并集,每个多面体再与仿射格相交,从而统一涵盖 CSR、COO、DIA、BCSR 等格式。UZP 采用模块化构建与优化,通过捕获稀疏结构的等价类,支持面向目标平台和应用需求的表示调优;可由整数坐标构建,并与现有 CSR/COO 软件互操作。作者在 SuiteSparse 的 200 多个矩阵上评估 CPU 上的 SpMV,表明简单且大多未优化的通用执行器已能利用 Z-多面体结构获得稳健性能。

问题
通用稀疏格式难以针对特定稀疏模式取得高性能,而专用格式往往缺乏灵活性与互操作性。
方法
提出 UZP,将稀疏结构抽象为整数多面体并集与仿射格的交,并给出模块化构建与优化方法,支持等价类捕获和与 CSR/COO 互操作。
评估
在 SuiteSparse 的 200+ 矩阵上对 CPU SpMV 进行性能评估,显示简单通用执行器已能利用 Z-多面体结构取得稳健性能。
原文摘要(Abstract)

Sparse data structures are ubiquitous in modern computing, and numerous formats have been designed to represent them. These formats may exploit specific sparsity patterns, aiming to achieve higher performance for key numerical computations than more general-purpose formats such as CSR and COO. In this work presents UZP, a new sparse format based on polyhedral sets of integer points. UZP is a flexible format that subsumes CSR, COO, DIA, BCSR, etc., by raising them to a common mathematical abstraction: a union of integer polyhedra, each intersected with an affine lattice. We present a modular approach to building and optimizing UZP: it captures equivalence classes for the sparse structure, enabling the tuning of the representation for target-specific and application-specific performance considerations. UZP is built from any input sparse structure using integer coordinates, and is interoperable with existing software using CSR and COO data layouts. We provide detailed performance evaluation of UZP on 200+ matrices from SuiteSparse, demonstrating how simple and mostly unoptimized generic executors for UZP can already achieve solid performance by exploiting 𝒵-polyhedra structures.

链接与引用

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

BibTeX
@article{paperbot3130,
  title = {Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs},
  author = {Alonso Rodríguez-Iglesias and Santoshkumar T. Tongli and Emily Tucker and Louis-Noël Pouchet and Gabriel Rodríguez and Juan Touriño},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {9},
  number = {PLDI},
  year = {2025},
  doi = {10.1145/3729335}
}