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

仅使用加法的矩阵乘法

Matrix Multiplication Using Only Addition

Daniel Cussen, Jeffrey D. Ullman

AI总结:

本文提出一种仅用加法和片上复制操作替代标量乘法的矩阵乘法方法,使芯片无需乘法器电路即可容纳更多处理器,从而实现净加速。

摘要:

矩阵乘法在许多机器学习算法中消耗了很大一部分时间。因此,能够比传统处理器甚至GPU更快地执行矩阵乘法的加速器芯片越来越受到关注。在本文中,我们展示了一种无需标量乘法器电路即可执行矩阵乘法的方法。在许多具有实际意义的情况下,只需一次加法和一次片上复制操作即可替代一次乘法。因此,设计一种矩阵乘法芯片成为可能,由于它不需要耗时、耗空间且耗能的乘法器电路,可以容纳更多的处理器,从而提供净加速。

英文摘要:

Matrix multiplication consumes a large fraction of the time taken in many machine-learning algorithms. Thus, accelerator chips that perform matrix multiplication faster than conventional processors or even GPU's are of increasing interest. In this paper, we demonstrate a method of performing matrix multiplication without a scalar multiplier circuit. In many cases of practical interest, only a single addition and a single on-chip copy operation are needed to replace a multiplication. It thus becomes possible to design a matrix-multiplier chip that, because it does not need time, space- and energy-consuming multiplier circuits, can hold many more processors, and thus provide a net speedup.

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

↑