arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.14558cs.DC
收藏

一种感知稀疏性的分布式内存稀疏-稀疏矩阵乘法算法

A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication

Yuxi Hong, Aydin Buluc

AI总结:

提出一种分布式内存1D SpGEMM算法,利用MPI RDMA和块获取策略降低通信成本,在多种配置下优于CombBLAS中的2D和3D实现。

摘要:

稀疏矩阵乘法(SpGEMM)是图算法、生物信息学、代数多重网格求解器和随机草图等领域常用的计算原语。SpGEMM的分布式内存并行算法主要集中于使用2D和3D划分的稀疏无关方法。感知稀疏性的1D算法理论上可通过不获取不参与乘法的稀疏矩阵非零元素来减少通信。本文提出了一种分布式内存1D SpGEMM算法及实现。它使用MPI RDMA操作来降低打包/解包子矩阵的通信成本,并采用块获取策略以避免过度的细粒度消息传递。结果表明,我们的1D实现在CombBLAS中的许多配置、输入和用例上优于最先进的2D和3D实现,且概念上更简单。

英文摘要:

Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid solvers, and randomized sketching. Distributed-memory parallel algorithms for SpGEMM have mainly focused on sparsity-oblivious approaches that use 2D and 3D partitioning. Sparsity-aware 1D algorithms can theoretically reduce communication by not fetching nonzeros of the sparse matrices that do not participate in the multiplication. Here, we present a distributed-memory 1D SpGEMM algorithm and implementation. It uses MPI RDMA operations to mitigate the cost of packing/unpacking submatrices for communication, and it uses a block fetching strategy to avoid excessive fine-grained messaging. Our results show that our 1D implementation outperforms state-of-the-art 2D and 3D implementations within CombBLAS for many configurations, inputs, and use cases, while remaining conceptually simpler.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑