FPGA-Based Simulated Bifurcation Machine
Since many combinatorial optimization problems can be mapped onto ground-state search problems of Ising models, special-purpose machines for Ising problems have attracted intense attention. Simulated bifurcation (SB) is a recently proposed algorithm to solve these Ising problems. One of the remarkab...
Uložené v:
| Vydané v: | International Conference on Field-programmable Logic and Applications s. 59 - 66 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.09.2019
|
| Predmet: | |
| ISSN: | 1946-1488 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Since many combinatorial optimization problems can be mapped onto ground-state search problems of Ising models, special-purpose machines for Ising problems have attracted intense attention. Simulated bifurcation (SB) is a recently proposed algorithm to solve these Ising problems. One of the remarkable features of SB is the high-degree parallelism underlying in the algorithm, providing an opportunity to solve the Ising problems very fast by massively parallel processing. In this work, we implement the SB algorithm on FPGAs by designing massively parallel custom circuits. We then compare the FPGA-based SB machines with a state-of-the-art machine called a coherent Ising machine (CIM), a highly optimized implementation of simulated annealing (SA), and GPU-based SB machines. SB machines with spin size of 2,048/4,096 (2K/4K) on an Arria10 GX1150 FPGA have 8,192 processing elements for the matrix-vector multiplication (MM) modules (the most computationally intensive part) and achieve computation throughput of 1,873/2,027 GMAC/s for the MM modules, outperforming 2K/4K SB machines on an Nvidia Tesla V100 GPU (113/183 GMAC/s). The 2K FPGA-SB solves all-to-all connected 2000-node MAX-CUT problem 14X (/124X) faster than the CIM (/the highly-optimized SA), with much better energy efficiency (288X better than the CIM). |
|---|---|
| AbstractList | Since many combinatorial optimization problems can be mapped onto ground-state search problems of Ising models, special-purpose machines for Ising problems have attracted intense attention. Simulated bifurcation (SB) is a recently proposed algorithm to solve these Ising problems. One of the remarkable features of SB is the high-degree parallelism underlying in the algorithm, providing an opportunity to solve the Ising problems very fast by massively parallel processing. In this work, we implement the SB algorithm on FPGAs by designing massively parallel custom circuits. We then compare the FPGA-based SB machines with a state-of-the-art machine called a coherent Ising machine (CIM), a highly optimized implementation of simulated annealing (SA), and GPU-based SB machines. SB machines with spin size of 2,048/4,096 (2K/4K) on an Arria10 GX1150 FPGA have 8,192 processing elements for the matrix-vector multiplication (MM) modules (the most computationally intensive part) and achieve computation throughput of 1,873/2,027 GMAC/s for the MM modules, outperforming 2K/4K SB machines on an Nvidia Tesla V100 GPU (113/183 GMAC/s). The 2K FPGA-SB solves all-to-all connected 2000-node MAX-CUT problem 14X (/124X) faster than the CIM (/the highly-optimized SA), with much better energy efficiency (288X better than the CIM). |
| Author | Tatsumura, Kosuke Dixon, Alexander R. Goto, Hayato |
| Author_xml | – sequence: 1 givenname: Kosuke surname: Tatsumura fullname: Tatsumura, Kosuke organization: Corporate Research and Development Center, Toshiba Corporation – sequence: 2 givenname: Alexander R. surname: Dixon fullname: Dixon, Alexander R. organization: Corporate Research and Development Center, Toshiba Corporation – sequence: 3 givenname: Hayato surname: Goto fullname: Goto, Hayato organization: Corporate Research and Development Center, Toshiba Corporation |
| BookMark | eNotjDFPwzAQhQ0CiVKysrB0ZEk4X2znbmyrpiAFUQmYq4vjCKM2RUk68O8pguW970mf3rW66A5dUOpWQ6Y18EO5qTIEzRnAKc9UwgXpAkkbIlOcq4lm49LfdaWSYfg8aWBNQdZN1H25Wc_ThQyhmb3G_XEn44kWsT32XsZ46GbP4j9iF27UZSu7IST_PVXv5ept-ZhWL-un5bxKIzoeU0IS04phB8i1IDoH1juLohFzYBdc7a3OCyeNFagbn1tk8k1L2NoG86m6-_uNIYTtVx_30n9viRgROP8BA_JA4A |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/FPL.2019.00019 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781728148847 1728148847 |
| EISSN | 1946-1488 |
| EndPage | 66 |
| ExternalDocumentID | 8892209 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-i269t-828a4fa496029ba226605c652a1223096e6bc51376ad5a0bdc35298cdf82f5d23 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 60 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000518670300009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:35:20 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i269t-828a4fa496029ba226605c652a1223096e6bc51376ad5a0bdc35298cdf82f5d23 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_8892209 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-09-01 |
| PublicationDateYYYYMMDD | 2019-09-01 |
| PublicationDate_xml | – month: 09 year: 2019 text: 2019-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | International Conference on Field-programmable Logic and Applications |
| PublicationTitleAbbrev | FPL |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000547856 |
| Score | 1.9793576 |
| Snippet | Since many combinatorial optimization problems can be mapped onto ground-state search problems of Ising models, special-purpose machines for Ising problems... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 59 |
| SubjectTerms | Bifurcation Combinatorial optimization Computational complexity Field programmable gate arrays FPGA GPU Graphics processing units HLS Ising problem Optimization Oscillators Parallel processing simulated annealing simulated bifurcation |
| Title | FPGA-Based Simulated Bifurcation Machine |
| URI | https://ieeexplore.ieee.org/document/8892209 |
| WOSCitedRecordID | wos000518670300009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED2VioEJUIv4VgYGBkwTN47tkSICQ6kiAVK3yvGHlIEWhYTfz9mJCgMLm-XFOlu6d3e-9w7gSk5F6WKXEsu5Iej9KFFKZYTrxLs_47gJkvlzvliI5VIWA7jZcmGstaH5zN76ZfjLNxvd-lLZRAhJqWfr7XDOO67Wtp4Se2EqlvW6jEksJ3kx961bXo8yCOn8mp4SwCPf_9-xBzD-YeFFxRZfDmFg1yO4zovHOzJD7DHRS_Xuh2_hala5tu6Kb9FzaI-0Y3jLH17vn0g_7YBUNJON53Or1KkUUwoqS4VhEWYaOmNUJQjhmGnYrNQsQYegDFNxaTTGTlJo4wR1zNDpEQzXm7U9hgjNV4xZajEmTVPmBNOKThGsypg5lpkTGHkrVx-doMWqN_D07-0z2PPX2DVWncOwqVt7Abv6q6k-68vwCt_hb4ac |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED1VgAQToBbxTQYGBkwT107skSJCEWkViSJ1qxx_SBloUWn5_ZydqjCwsFlerLOle3fne-8ArmVPVC52jNgsMwS9HyVKqZRkOvHuz7jMBMn8IhuNxGQiyxbcbrgw1trQfGbv_DL85Zu5XvlSWVcISaln621zxmjSsLU2FZXYS1PxdK3MmMSym5eFb97yipRBSufX_JQAH_n-_w4-gM4PDy8qNwhzCC07a8NNXj7dkz6ij4le63c_fgtX_dqtFk35LRqGBknbgbf8cfwwIOt5B6SmqVx6RrdiTjFMKqisFAZGmGvolFOVIIhjrmHTSvMEXYIyXMWV0Rg9SaGNE9RxQ3tHsDWbz-wxRGi-4txSi1EpY9wJrhXtIVxVMXc8NSfQ9lZOPxpJi-nawNO_t69gdzAeFtPiefRyBnv-Sps2q3PYWi5W9gJ29Ney_lxchhf5BhjPieM |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Field-programmable+Logic+and+Applications&rft.atitle=FPGA-Based+Simulated+Bifurcation+Machine&rft.au=Tatsumura%2C+Kosuke&rft.au=Dixon%2C+Alexander+R.&rft.au=Goto%2C+Hayato&rft.date=2019-09-01&rft.pub=IEEE&rft.eissn=1946-1488&rft.spage=59&rft.epage=66&rft_id=info:doi/10.1109%2FFPL.2019.00019&rft.externalDocID=8892209 |