FPIA:采用存内计算的现场可编程伊辛阵列
FPIA: Field-Programmable Ising Arrays with In-Memory Computing
AI总结:
针对二次伊辛机存内计算实现资源利用率低的问题,受岛式FPGA启发提出FPIA存内计算架构,结合开源工具优化映射与布线,实现最高60倍面积提升与更快运算,并探讨算法-电路协同设计方向。
摘要:
伊辛机(Ising Machine)是一种用于求解组合优化问题的极具潜力的计算方法,天然适配基于新型存储器的低功耗紧凑型存内计算实现方案。二次伊辛机的朴素存内计算实现需要一个耦合权重阵列,其规模随问题尺寸呈二次增长。但由于实际优化问题存在稀疏性,这类方法的资源利用效率很低。我们首先证明,将耦合阵列划分为更小的子阵列可解决该问题。不过该技术需要实现子阵列间的互连,因此受岛式现场可编程门阵列启发,我们开发了面向二次伊辛机的存内计算架构,这是本文的核心贡献。我们适配了开源工具来优化问题映射并对布线开销建模。针对所开发架构的基准问题建模结果显示,与基线方法相比,其面积改善最高达60倍,且运行速度更快。最后,我们讨论了可实现进一步提升的算法-电路协同设计技术。
英文摘要:
Ising Machine is a promising computing approach for solving combinatorial optimization problems. It is naturally suited for energy-saving and compact in-memory computing implementations with emerging memories. A naïve in-memory computing implementation of a quadratic Ising Machine requires an array of coupling weights that grows quadratically with problem size. However, the resources in such an approach are used inefficiently due to sparsity in practical optimization problems. We first show that this issue can be addressed by partitioning a coupling array into smaller sub-arrays. This technique, however, requires interconnecting subarrays; hence, we developed in-memory computing architecture for quadratic Ising Machines inspired by island-type field programmable gate arrays, which is the main contribution of our paper. We adapt open-source tools to optimize problem embedding and model routing overhead. Modeling results of benchmark problems for the developed architecture show up to 60x area improvement and faster operation than the baseline approach. Finally, we discuss algorithm/circuit co-design techniques for further improvements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。