Scalable In-Memory Clustered Annealer With Temporal Noise of Charge Trap Transistor for Large Scale Travelling Salesman Problems
- 13 February 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 13 (1) , 422-435
Abstract
Combinatorial optimization problems (COP) are ubiquitous and practical in our daily life, but many of them are NP-hard and intractable to solve using conventional computing. Ising model-based annealer has gained increasing attention due to its efficiency in finding fast and approximate solutions. However, such solvers are suffering from scalability problem due to quadratically increasing spins, and there are few hardware designs proposed to support large-scale COPs. In this paper, we propose scalable in-memory annealers to solve the large-scale travelling salesman problem (TSP) with crossbar arrays of FinFET based charge trap transistors. The intrinsic temporal noise of the drain current caused by trapping/detrapping is used to realize the annealing process. We apply two kinds of hardware implementations to map Ising model: 1) Hopfield neural network (HNN) based design, converting from a graph network to a regular neural network to utilize crossbar memory arrays; 2) index-based design, using index to record the order to avoid the quadratic scaling up of spins to represent all permutations. For both implementations, hierarchical clustering algorithms are adopted to enable the solving of large-scale TSP and overcome the scalability challenge. We further speed up the system convergence by updating non-adjacent clusters in parallel with equal size k-means clustering. At last, three hardware designs (HNN with conventional and equal-size clustering, index method with conventional clustering) are tested with up to 1060-city problems and benchmarked by the system-level simulation to show their trade-offs. They all show benefits on fast convergence and ultra-low energy compared with state-of-the-art annealers, and present advantages on accuracy, chip area, or latency/energy consumption, respectively.Keywords
Funding Information
- Intel Emerging Technology Strategic Research Sector
- Exploratory Integrated Circuits group, Components Research, Intel Corporation
This publication has 26 references indexed in Scilit:
- 7.3 STATICA: A 512-Spin 0.25M-Weight Full-Digital Annealing Processor with a Near-Memory All-Spin-Updates-at-Once Architecture for Combinatorial Optimization with Complete Spin-Spin Interactions2020
- 31.2 CIM-Spin: A 0.5-to-1.2V Scalable Annealing Processor Using Digital Compute-In-Memory Spin Operators and Register-Based Spins for Combinatorial Optimization Problems2020
- DNN+NeuroSim: An End-to-End Benchmarking Framework for Compute-in-Memory Accelerators with Versatile Device Technologies2019
- An Analog Neuro-Optimizer with Adaptable Annealing Based on 64×64 0T1R Crossbar Circuit2019
- p-bits for probabilistic spin logicApplied Physics Reviews, 2019
- 2.6 A 2 ×30k-Spin Multichip Scalable Annealing Processor Based on a Processing-In-Memory Approach for Solving Large-Scale Combinatorial Optimization Problems2019
- A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS AnnealingIEEE Journal of Solid-State Circuits, 2015
- A Novel FinFET With High-Speed and Prolonged Retention for Dynamic MemoryIEEE Electron Device Letters, 2014
- Hopfield neural networks for optimization: study of the different dynamicsNeurocomputing, 2002
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991