Xabclib:一个全自动调优的稀疏迭代求解器
Xabclib:A Fully Auto-tuned Sparse Iterative Solver
AI总结:
本文提出 OpenATLib 自动调优接口并开发全自动调优稀疏迭代求解器 Xabclib,通过优化 SpMV 线程实现和数值计算策略,实现显著加速、内存缩减并避免错误收敛。
摘要:
本文提出一个名为 OpenATLib 的通用应用程序编程接口,用于自动调优(AT)。OpenATLib 旨在建立 AT 函数的可复用性。通过使用 OpenATLib,我们开发了一个名为 Xabclib 的全自动调优稀疏迭代求解器。Xabclib 具有若干新颖的运行时 AT 函数。首先,针对线程处理实现了以下新的稀疏矩阵-向量乘法(SpMV)实现:(1)非零元素;(2)面向向量归约的零元素计算省略;(3)无分支分段扫描(BSS)。根据性能评估以及与传统实现的比较,获得了以下结果:(1)对于对称 SpMV,非零元素与零元素计算省略实现了 14 倍加速;(2)使用 BSS 实现了 4.62 倍加速。我们还开发了一种“数值计算策略”,可以优化内存空间和计算精度。使用该策略,我们获得了以下结果:(1)平均 1/45 的内存空间缩减;(2)避免了传统求解器中存在的“错误收敛”情况。
英文摘要:
In this paper, we propose a general application programming interface named OpenATLib for auto-tuning (AT). OpenATLib is designed to establish the reusability of AT functions. By using OpenATLib, we develop a fully auto-tuned sparse iterative solver named Xabclib. Xabclib has several novel run-time AT functions. First, the following new implementations of sparse matrix-vector multiplication (SpMV) for thread processing are implemented:(1) non-zero elements; (2) omission of zero-elements computation for vector reduction; (3) branchless segmented scan (BSS). According to the performance evaluation and the comparison with conventional implementations, the following results are obtained: (1) 14x speedup for non-zero elements and zero-elements computation omission for symmetric SpMV; (2) 4.62x speedup by using BSS. We also develop a "numerical computation policy" that can optimize memory space and computational accuracy. Using the policy, we obtain the following: (1) an averaged 1/45 memory space reduction; (2) avoidance of the "fault convergence" situation, which is a problem of conventional solvers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。