CMOS Annealing Machine: A Domain-Specific Architecture for Combinatorial Optimization Problem

C. Yoshimura, Masato Hayashi, Takashi Takemoto, M. Yamaoka
{"title":"CMOS Annealing Machine: A Domain-Specific Architecture for Combinatorial Optimization Problem","authors":"C. Yoshimura, Masato Hayashi, Takashi Takemoto, M. Yamaoka","doi":"10.1109/ASP-DAC47756.2020.9045326","DOIUrl":null,"url":null,"abstract":"Domain-specific architectures are being studied to improve computer performance beyond the end of Moore’s Law. Here, we propose a new computing architecture, the CMOS annealing machine, which provides a fast means of solving combinatorial optimization problems. Our architecture is based on in-memory computing architecture through utilizing the locality of interactions in the Ising model. The prototype presented in 2019 has two processors on a business-card-sized board and solves problems 55 times faster than conventional computers.","PeriodicalId":125112,"journal":{"name":"2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASP-DAC47756.2020.9045326","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Domain-specific architectures are being studied to improve computer performance beyond the end of Moore’s Law. Here, we propose a new computing architecture, the CMOS annealing machine, which provides a fast means of solving combinatorial optimization problems. Our architecture is based on in-memory computing architecture through utilizing the locality of interactions in the Ising model. The prototype presented in 2019 has two processors on a business-card-sized board and solves problems 55 times faster than conventional computers.
CMOS退火炉:组合优化问题的特定领域架构
人们正在研究特定领域的体系结构,以提高计算机性能,超越摩尔定律的终结。在这里,我们提出了一种新的计算架构,CMOS退火炉,它提供了一种快速解决组合优化问题的手段。我们的架构是基于内存计算架构,利用了Ising模型中交互的局部性。2019年展示的原型机在一张名片大小的电路板上有两个处理器,解决问题的速度是传统计算机的55倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信