arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1711.05487cs.PFcs.MS
收藏

稀疏矩阵向量乘法在现代多核和众核处理器上的性能分析与优化

Performance Analysis and Optimization of Sparse Matrix-Vector Multiplication on Modern Multi- and Many-Core Processors

Athena Elafrou, Georgios Goumas, Nektarios Koziris

摘要:

本文提出了一种低开销的优化无处不在的稀疏矩阵向量乘法(SpMV)内核。不同处理器之间的体系结构多样性以及不同稀疏矩阵之间的结构多样性导致瓶颈多样性。这证明了SpMV优化器通过运行时专门化是矩阵和架构自适应的。为此,我们提出了一种方法,首先通过分析或矩阵属性检查确定SpMV在目标平台上给定稀疏矩阵的性能瓶颈,然后选择合适的优化来解决这些瓶颈。我们的优化池基于广泛使用的压缩稀疏行(CSR)稀疏矩阵存储格式,具有较低的预处理开销,即使在需要快速决策和优化设置的情况下,我们的整体方法也很实用。我们在三个基于x86的计算平台上评估了我们的优化器,并证明它能够在代表性测试套件中区分并适当优化大多数矩阵的SpMV,从而比最新版本的英特尔MKL库中提供的CSR和Inspector-Executor CSR SpMV内核实现了显著的加速提升。

英文摘要:

This paper presents a low-overhead optimizer for the ubiquitous sparse matrix-vector multiplication (SpMV) kernel. Architectural diversity among different processors together with structural diversity among different sparse matrices lead to bottleneck diversity. This justifies an SpMV optimizer that is both matrix- and architecture-adaptive through runtime specialization. To this direction, we present an approach that first identifies the performance bottlenecks of SpMV for a given sparse matrix on the target platform either through profiling or by matrix property inspection, and then selects suitable optimizations to tackle those bottlenecks. Our optimization pool is based on the widely used Compressed Sparse Row (CSR) sparse matrix storage format and has low preprocessing overheads, making our overall approach practical even in cases where fast decision making and optimization setup is required. We evaluate our optimizer on three x86-based computing platforms and demonstrate that it is able to distinguish and appropriately optimize SpMV for the majority of matrices in a representative test suite, leading to significant speedups over the CSR and Inspector-Executor CSR SpMV kernels available in the latest release of the Intel MKL library.

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

↑