可扩展性
计算机科学
并行计算
模拟退火
伊辛模型
路由器
现场可编程门阵列
计算科学
算法
分布式计算
计算机硬件
计算机网络
统计物理学
物理
数据库
作者
Dong Jiang,Xiangrui Wang,Zhanhong Huang,Yongkui Yang,Enyi Yao
出处
期刊:IEEE Transactions on Circuits and Systems I-regular Papers
[Institute of Electrical and Electronics Engineers]
日期:2023-04-05
卷期号:70 (7): 2868-2880
被引量:8
标识
DOI:10.1109/tcsi.2023.3263923
摘要
Combinatorial optimization problems are prevalent in many different fields. Most of these problems are NP-hard and challenging for computers with conventional Von-Neumann architecture. Ising machines with a number of spins have the potential to solve these problems by emulating the natural annealing process of solid matter. Recent research has explored some hardware implementation methods of Ising machines to accelerate the convergence process of such problems at room temperature. However, most of them are suffering from low scalability and low parallel processing capability due to the huge hardware cost and high complexity. In this paper, a novel network-on-chip-based annealing processing architecture (NoCAPA) for a large-scale Ising processor is described to address these issues with a NoC computing paradigm, a distributed storage scheme, and a fully pipelined structure design. Several techniques are developed to further increase convergence speed and reduce hardware resource consumption, including a dynamic multithread parallel update algorithm, a router with merge and deflection abilities, and a unique multiply-accumulate operation. The prototype is implemented in FPGA with the maximum operation frequency of 200MHz, achieving up to $120.5\times $ faster than conventional simulated annealing method when solving the max-cut problem while supporting high scalability.
科研通智能强力驱动
Strongly Powered by AbleSci AI