arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.04531cs.CCcs.ETcs.NAmath.NA
收藏

时间复杂度为O(1)

In-memory eigenvector computation in time O(1)

Zhong Sun, Giacomo Pedretti, Elia Ambrosi, Alessandro Bricalli, Daniele Ielmini

摘要:

利用交叉点电阻存储器阵列的存内计算在以数据为中心的应用的计算中加速矩阵向量乘法已经获得了极大的关注。通过组合交叉点阵列和反馈放大器,可以在一个步骤中计算矩阵特征向量,而无需算法迭代。在这项工作中,时间复杂度的特征向量计算的基础上,交叉点电路的反馈分析。结果表明,电路的计算时间取决于电路中实现的特征值的失配程度,从而控制输出电压的上升速度。对于随机矩阵的数据集,计算电路中的主特征向量的时间对于各种矩阵大小是恒定的,即时间复杂度是O(1)。O(1)的时间复杂度也得到了现实世界数据集PageRank模拟的支持。这项工作为在广泛的实际应用中进行特征向量计算的快速,节能的加速器铺平了道路。

英文摘要:

In-memory computing with crosspoint resistive memory arrays has gained enormous attention to accelerate the matrix-vector multiplication in the computation of data-centric applications. By combining a crosspoint array and feedback amplifiers, it is possible to compute matrix eigenvectors in one step without algorithmic iterations. In this work, time complexity of the eigenvector computation is investigated, based on the feedback analysis of the crosspoint circuit. The results show that the computing time of the circuit is determined by the mismatch degree of the eigenvalues implemented in the circuit, which controls the rising speed of output voltages. For a dataset of random matrices, the time for computing the dominant eigenvector in the circuit is constant for various matrix sizes, namely the time complexity is O(1). The O(1) time complexity is also supported by simulations of PageRank of real-world datasets. This work paves the way for fast, energy-efficient accelerators for eigenvector computation in a wide range of practical applications.

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

↑