在FPGA上分解大规模伊辛问题:一种混合硬件方法
An FPGA-ASIC Co-Design Framework for Capacity-Constrained Physics-Based Ising Chips
AI总结:
本文提出一种混合硬件方法,在FPGA上分解大规模伊辛问题,通过减少通信延迟提升求解速度和能效。
摘要:
新兴的类比计算子系统,如基于振荡器的伊辛机,为组合优化提供了快速收敛时间,但往往由于物理实现限制而存在可扩展性有限的问题。为了处理涉及数千个变量的现实问题,需要进行问题分解;然而,在标准CPU上执行此步骤会引入显著延迟,阻止高速求解器发挥全部能力。本文提出了一种异构系统,将分解任务卸载到FPGA上,与定制的28nm伊辛求解器紧密集成。通过将分解逻辑迁移到可重新配置的硬件中,并利用并行处理元件,该系统最小化了通常与主机-设备交互相关的通信延迟。我们的评估表明,这种联合设计方法有效弥补了数字预处理和模拟求解之间的速度差距,与在现代CPU上运行的优化软件基线相比,实现了近2倍的速度提升和超过两个数量级的能量效率提升。
英文摘要:
When a problem exceeds an analog Ising machine's spin capacity it cannot be solved in one shot: a digital orchestration layer must iteratively decompose the graph, clamp boundary spins, and deliver hardware-sized subproblems to the solver. As per-subproblem solve times reach the us-scale regime, this digital layer (not the analog core) becomes the primary scalability bottleneck. On a 28 nm CMOS coupled-oscillator Ising chip (T_core ~ 77.5 us, 24 mW), a CPU orchestrator leaves the solver idle for over 98% of every iteration at N=750, and the gap survives OpenMP and AVX2 optimization because it is dominated by data-dependent memory access rather than arithmetic throughput. We argue that the orchestration layer is a first-class design object and propose a sizing methodology for hybrid analog-digital Ising systems: given a solver's core time, clock frequency, and target problem class, it gives an analytical baseline for hardware parallelism and memory-bandwidth dimensioning. Guided by the sizing laws, an FPGA orchestration layer co-located with the chip satisfies the pipeline condition with substantial margin. Across graph coloring, MaxCut, and SAT benchmarks it delivers 9.8x-46.5x raw end-to-end time-to-solution (TTS) improvements (14.8x-65.9x on per-repeat runtime) over the optimized CPU orchestrator, with device-level power reductions of 85x-116x.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。