A Cloud-ready Scalable Annealing Processor for Solving Large-scale Combinatorial Optimization Problems

Masato Hayashi, Takashi Takemoto, C. Yoshimura, M. Yamaoka
{"title":"A Cloud-ready Scalable Annealing Processor for Solving Large-scale Combinatorial Optimization Problems","authors":"Masato Hayashi, Takashi Takemoto, C. Yoshimura, M. Yamaoka","doi":"10.23919/VLSIT.2019.8776512","DOIUrl":null,"url":null,"abstract":"This paper presents a CMOS annealing processor (CMOS-AP) that accelerates ground state searches of the Ising model. The main feature of this processor is its inter-chip connection interface for making a larger chip. A credit card sized compute node integrating two CMOS-APs was also developed as an interface with existing computer systems. The compute node can handle up to 61,952 spins at a time. A performance evaluation using the node improved the CPU speed by 55 times in solving a minimum vertex cover problem, one of the NP-hard combinatorial optimization problems. Finally, we describe a cloud interface for the compute node to make the CMOS-APs more useful and to promote application development for it.","PeriodicalId":6752,"journal":{"name":"2019 Symposium on VLSI Technology","volume":"5 1","pages":"C148-C149"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Symposium on VLSI Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/VLSIT.2019.8776512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper presents a CMOS annealing processor (CMOS-AP) that accelerates ground state searches of the Ising model. The main feature of this processor is its inter-chip connection interface for making a larger chip. A credit card sized compute node integrating two CMOS-APs was also developed as an interface with existing computer systems. The compute node can handle up to 61,952 spins at a time. A performance evaluation using the node improved the CPU speed by 55 times in solving a minimum vertex cover problem, one of the NP-hard combinatorial optimization problems. Finally, we describe a cloud interface for the compute node to make the CMOS-APs more useful and to promote application development for it.
解决大规模组合优化问题的云就绪可扩展退火处理器
提出了一种加速伊辛模型基态搜索的CMOS退火处理器(CMOS- ap)。该处理器的主要特点是它的芯片间连接接口,用于制作更大的芯片。集成两个cmos - ap的信用卡大小的计算节点也被开发作为与现有计算机系统的接口。该计算节点一次最多可以处理61952个旋转。在解决最小顶点覆盖问题(NP-hard组合优化问题之一)时,使用该节点的性能评估将CPU速度提高了55倍。最后,我们描述了计算节点的云接口,以使cmos - ap更有用,并促进其应用程序的开发。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信