FPIM:用于求解 SAT 的现场可编程 Ising 机
FPIM: Field-Programmable Ising Machines for Solving SAT
AI总结:
本文提出可重构片上模拟 Ising 机 FPIM,通过布尔逻辑综合与 Ising 等效电路映射 SAT,并在 SATLIB 的 2000 个问题上验证其低稀疏度、低 BCR 和面积可行性。
摘要:
片上模拟 Ising 机(IM)是求解困难组合优化问题的一种有前景的手段。为使可扩展的片上实现具备实用性,需要满足:1)问题应以可扩展方式映射为 Ising 形式;2)自旋之间的互连应稀疏;3)编程互连权重所需的耦合分辨率位数(BCR)应较少;4)芯片应能够求解具有不同连接拓扑的问题。我们针对 SATisfiability(可满足性)问题研究这些问题,并设计了 FPIM,这是一种非常适合 SAT 的可重构片上模拟 Ising 机方案。为将 SAT 问题映射到 FPIM,我们首先利用布尔逻辑综合,但用 Ising 等效电路替换综合得到的逻辑门,这些电路的模拟动力学通过最小化 Ising Hamiltonian 来求解 SAT。我们将该方法应用于来自 SATLIB 的 2000 个基准问题,展示了优异的可扩展性,以及与问题规模无关的低稀疏度和低 BCR。布局/布线表明,实现所有基准问题只需少于 10 条布线通道,这一要求非常可行;在 65nm 工艺下,这对应于一个可编程的 1000 自旋 FPIM 约 10mm^2 的面积需求。
英文摘要:
On-chip analog Ising Machines (IMs) are a promising means to solve difficult combinatorial optimization problems. For scalable on-chip realizations to be practical, 1) the problem should map scalably to Ising form, 2) interconnectivity between spins should be sparse, 3) the number of bits of coupling resolution (BCR) needed for programming interconnection weights should be small, and 4) the chip should be capable of solving problems with different connection topologies. We explore these issues for the SATisfiability problem and devise FPIM, a reconfigurable on-chip analog Ising machine scheme well suited for SAT. To map SAT problems onto FPIMs, we leverage Boolean logic synthesis as a first step, but replace synthesized logic gates with Ising equivalent circuits whose analog dynamics solve SAT by minimizing the Ising Hamiltonian. We apply our approach to 2000 benchmark problems from SATLIB,demonstrating excellent scaling, together with low sparsity and low BCR that are independent of problem scale. Placement/routing reveals a very feasible requirement of less than 10 routing tracks to implement all the benchmarks, translating to an area requirement of about 10mm^2 for a programmable 1000-spin FPIM in 65nm technology.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。