HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

FPGA-Based Annealing Processor with Time-Division Multiplexing

Files in This Item:

The file(s) associated with this item can be obtained from the following URL:https://doi.org/10.1587/transinf.2019PAP0002


Title: FPGA-Based Annealing Processor with Time-Division Multiplexing
Authors: Yamamoto, Kasho1 Browse this author
Ikebe, Masayuki2 Browse this author →KAKEN DB
Asai, Tetsuya3 Browse this author →KAKEN DB
Motomura, Masato4 Browse this author
Takamaeda, Shinya5 Browse this author
Authors(alt): Yamazaki, Shinya5
Keywords: ising model
annealing processor
simulated annealing
Issue Date: Dec-2019
Publisher: The Institute of Electronics, Information and Communication Engineers
IEICE
Journal Title: IEICE transactions on information and systems
Issue: 12
Start Page: 2295
End Page: 2305
Publisher DOI: 10.1587/transinf.2019PAP0002
Abstract: An annealing processor based on the Ising model is a remarkable candidate for combinatorial optimization problems and it is superior to general von Neumann computers. CMOS-based implementations of the annealing processor are efficient and feasible based on current semiconductor technology. However, critical problems with annealing processors remain. There are few simulated spins and inflexibility in terms of implementable graph topology due to hardware constraints. A prior approach to overcoming these problems is to emulate a complicated graph on a simple and high-density spin array with so-called minor embedding, a spin duplication method based on graph theory. When a complicated graph is embedded on such hardware, numerous spins are consumed to represent high-degree spins by combining multiple low-degree spins. In addition to the number of spins, the quality of solutions decreases as a result of dummy strong connections between the duplicated spins. Thus, the approach cannot handle large-scale practical problems. This paper proposes a flexible and scalable hardware architecture with time-division multiplexing for massive spins and high-degree topologies. A target graph is separated and mapped onto multiple virtual planes, and each plane is subject to interleaved simulation with time-division processing. Therefore, the behavior of high-degree spins is efficiently emulated over time, so that no dummy strong connections are required, and the solution quality is accordingly improved. We implemented a prototype hardware design for FPGAs, and we evaluated the proposed method in a software-based annealing processor simulator. The results indicate that the method increased the spins that can be deployed. In addition, our time-division multiplexing architecture improved the solution quality and convergence time with reasonable resource consumption.
Rights: Copyright ©2019 The Institute of Electronics, Information and Communication Engineers
https://search.ieice.org/
Type: article
URI: http://hdl.handle.net/2115/76501
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Export metadata:

OAI-PMH ( junii2 , jpcoar )

MathJax is now OFF:


 

Feedback - Hokkaido University