结合处理器上的稀疏矩阵乘法
Sparse Matrix Multiplication On An Associative Processor
摘要:
稀疏矩阵乘法是线性代数计算的重要组成部分。在关联处理器(AP)上实现稀疏矩阵乘法能够实现高水平的并行性,其中一个矩阵的行与整个第二矩阵并行相乘,并且其中向量点积的执行时间不取决于向量大小。本文探讨了四种稀疏矩阵乘法算法,结合AP和基线CPU处理到不同的水平。他们评估一个大的稀疏矩阵集的模拟。AP上稀疏矩阵乘法的计算复杂性为O(nnz),其中nnz是非零元素的个数. AP被发现是特别有效的二进制稀疏矩阵乘法。AP在能效方面优于传统解决方案。
英文摘要:
Sparse matrix multiplication is an important component of linear algebra computations. Implementing sparse matrix multiplication on an associative processor (AP) enables high level of parallelism, where a row of one matrix is multiplied in parallel with the entire second matrix, and where the execution time of vector dot product does not depend on the vector size. Four sparse matrix multiplication algorithms are explored in this paper, combining AP and baseline CPU processing to various levels. They are evaluated by simulation on a large set of sparse matrices. The computational complexity of sparse matrix multiplication on AP is shown to be an O(nnz) where nnz is the number of nonzero elements. The AP is found to be especially efficient in binary sparse matrix multiplication. AP outperforms conventional solutions in power efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。