ABSTRACT
Combinatorial optimizations are widely adopted in scientific and engineering applications, such as VLSI design, automated machine learning (AutoML), and compiler design. Combinatorial optimization problems are notoriously challenging to exactly solve due to the NP-hardness. Scientists have long discovered that numerically simulating classical nonlinear Hamiltonian systems can effectively solve many well-known combinatorial optimization problems. However, such physical simulation typically requires a massive amount of computation, which even outstrips the logic capability of modern reconfigurable digital fabrics. In this work, we proposed an FPGA-based general combinatorial optimization problem solver which achieved ultra-high performance and scalability. Specifically, we first reformulated a broad range of combinatorial optimization problems with a general graph-based data structure called the Ising model. Second, instead of utilizing classical simulated annealing to find an approximate solution, we utilized a new heuristic algorithm, simulated bifurcation, to search for solutions. Third, we designed an efficient hardware architecture to fully exploit FPGAs' potentials to accelerate the algorithm, and proposed three hardware-software co-optimizations to further improve the performance. By experimenting on benchmarks, our proposal outperformed the state-of-the-art simulated annealing optimization solver by up to 10.91 times.
- Lev Yu Barash, Martin Weigel, Michal Borovskỳ, Wolfhard Janke, and Lev N Shchur. 2017. GPU accelerated population annealing algorithm. Computer Physics Communications , Vol. 220 (2017), 341--350.Google ScholarCross Ref
- Benjamin Block, Peter Virnau, and Tobias Preis. 2010. Multi-GPU accelerated multi-spin Monte Carlo simulations of the 2D Ising model. Computer Physics Communications , Vol. 181, 9 (2010), 1549--1556.Google ScholarCross Ref
- Chase Cook, Hengyang Zhao, Takashi Sato, Masayuki Hiromoto, and Sheldon X-D Tan. 2018. GPU based parallel Ising computing for combinatorial optimization problems in VLSI physical design. arXiv preprint arXiv:1807.10750 (2018).Google Scholar
- Guohao Dai, Yuze Chi, Yu Wang, and Huazhong Yang. 2016. Fpgp: Graph processing framework on fpga a case study of breadth-first search. In Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM, 105--110.Google ScholarDigital Library
- A Das. 2005. Quantum Annealing and Analog Quantum Computation Lecture Notes in Physics 679, ed Das A and Chakrabarti BK.Google Scholar
- Hayato Goto, Kosuke Tatsumura, and Alexander R Dixon. 2019. Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems. Science advances , Vol. 5, 4 (2019), eaav2372.Google Scholar
- Hidenori Gyoten, Masayuki Hiromoto, and Takashi Sato. 2018a. Area efficient annealing processor for Ising model without random number generator. IEICE TRANSACTIONS on Information and Systems , Vol. 101, 2 (2018), 314--323.Google ScholarCross Ref
- Hidenori Gyoten, Masayuki Hiromoto, and Takashi Sato. 2018b. Enhancing the solution quality of hardware Ising-model solver via parallel tempering. In 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 1--8.Google ScholarDigital Library
- Sergei V Isakov, Ilia N Zintchenko, Troels F Rønnow, and Matthias Troyer. 2015. Optimised simulated annealing for Ising spin glasses. Computer Physics Communications , Vol. 192 (2015), 265--271.Google ScholarCross Ref
- Tadashi Kadowaki and Hidetoshi Nishimori. 1998. Quantum annealing in the transverse Ising model. Physical Review E , Vol. 58, 5 (1998), 5355.Google ScholarCross Ref
- Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations . Springer, 85--103.Google Scholar
- Scott Kirkpatrick, C Daniel Gelatt, and Mario P Vecchi. 1983. Optimization by simulated annealing. science , Vol. 220, 4598 (1983), 671--680.Google Scholar
- Benedict Leimkuhler and Sebastian Reich. 2004. Simulating hamiltonian dynamics . Vol. 14. Cambridge university press.Google Scholar
- Andrew Lucas. 2014. Ising formulations of many NP problems. Frontiers in Physics , Vol. 2 (2014), 5.Google ScholarCross Ref
- Nicholas Metropolis, Arianna W Rosenbluth, Marshall N Rosenbluth, Augusta H Teller, and Edward Teller. 1953. Equation of state calculations by fast computing machines. The journal of chemical physics , Vol. 21, 6 (1953), 1087--1092.Google ScholarCross Ref
- Kosuke Tatsumura, Alexander Dixon, and Hayato Goto. 2019. FPGA-Based Simulated Bifurcation Machine. In 2019 29th International Conference on Field Programmable Logic and Applications (FPL). IEEE, 59--66.Google Scholar
- Tianshi Wang and Jaijeet Roychowdhury. 2019. OIM: Oscillator-based Ising Machines for Solving Combinatorial Optimisation Problems. In International Conference on Unconventional Computation and Natural Computation. Springer, 232--256.Google Scholar
- Martin Weigel. 2011. Simulating spin models on GPU. Computer Physics Communications , Vol. 182, 9 (2011), 1833--1836.Google ScholarCross Ref
- Martin Weigel. 2012. Performance potential for simulating spin models on GPU. J. Comput. Phys. , Vol. 231, 8 (2012), 3064--3082.Google ScholarDigital Library
- Xilinx. 2017. FIFO Generator v13.2. (2017). https://www.xilinx.com/support/documentation/ip_documentation/fifo_generator/v13_2/pg057-fifo-generator.pdfGoogle Scholar
- Masanao Yamaoka, Chihiro Yoshimura, Masato Hayashi, Takuya Okuyama, Hidetaka Aoki, and Hiroyuki Mizuno. 2015. A 20k-spin Ising chip to solve combinatorial optimization problems with CMOS annealing. IEEE Journal of Solid-State Circuits , Vol. 51, 1 (2015), 303--309.Google Scholar
- Chihiro Yoshimura, Masato Hayashi, Takuya Okuyama, and Masanao Yamaoka. 2016. FPGA-based annealing processor for Ising model. In 2016 Fourth International Symposium on Computing and Networking (CANDAR). IEEE, 436--442.Google ScholarCross Ref
- Chihiro Yoshimura, Masato Hayashi, Takuya Okuyama, and Masanao Yamaoka. 2017. Implementation and evaluation of FPGA-based annealing processor for ising model by use of resource sharing. International Journal of Networking and Computing , Vol. 7, 2 (2017), 154--172.Google ScholarCross Ref
- Shijie Zhou, Charalampos Chelmis, and Viktor K Prasanna. 2016. High-throughput and energy-efficient graph processing on fpga. In 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE, 103--110.Google ScholarCross Ref
- Shijie Zhou, Rajgopal Kannan, Yu Min, and Viktor K Prasanna. 2018. FASTCF: FPGA-based accelerator for stochastic-gradient-descent-based collaborative filtering. In Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM, 259--268.Google ScholarDigital Library
- Shijie Zhou, Rajgopal Kannan, Viktor K Prasanna, Guna Seetharaman, and Q Wu. 2019. HitGraph: High-throughput Graph Processing Framework on FPGA. IEEE Transactions on Parallel and Distributed Systems (2019).Google Scholar
- Yu Zou and Mingjie Lin. 2018. GridGAS: An I/O-Efficient Heterogeneous FPGAGoogle Scholar
- CPU Computing Platform for Very Large-Scale Graph Analytics. In 2018 International Conference on Field-Programmable Technology (FPT). IEEE, 246--249.Google Scholar
Index Terms
- Massively Simulating Adiabatic Bifurcations with FPGA to Solve Combinatorial Optimization
Recommendations
Penguins Search Optimization Algorithm to Solve Quadratic Assignment Problem
BDCA'17: Proceedings of the 2nd international Conference on Big Data, Cloud and ApplicationsThis paper presents an application of new metaheuristics, based on the penguins hunting strategy, Penguins search optimization algorithm (PeSOA) for solving one of the most difficult NP-hard combinatorial optimization problems in discret case the ...
A discrete gravitational search algorithm for solving combinatorial optimization problems
Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The ...
New meta-heuristic for combinatorial optimization problems: intersection based scaling
Combinatorial optimization problems are found in many application fields such as computer science, engineering and economy. In this paper, a new efficient meta-heuristic, Intersection-Based Scaling (IBS fbr abbreviation), is proposed and it can be ...
Comments