SatIn:布尔可满足性推理硬件
SatIn: Hardware for Boolean Satisfiability Inference
摘要:
本文介绍了SatIn,硬件加速器确定布尔可满足性(SAT)-一个重要的问题,在许多领域,包括验证,安全分析和规划。SatIn基于一个分布式关联数组,它可以执行简短的原子操作,这些操作可以组成高级操作。为了克服线延迟所施加的缩放限制,我们扩展了软件求解器中使用的算法,以有效地在一组分布式节点上使用消息传递进行通信。在真实基准测试上进行的周期级模拟显示,SatIn与2016年SAT竞赛的获胜者Glucose相比,平均实现了72倍的加速,并有可能在两种情况下实现113倍的加速。为了量化SatIn的物理要求,我们使用Synopsys 32 nm教育开发工具包放置并路由单个条款。我们能够满足1 ns周期约束,我们的目标子句适合4867um^2,消耗63.8uW的动态功率;对于网络,这对应于在500mm^2 32 nm芯片中消耗8.3W的动态功率(不包括泄漏或全局时钟功率)的100 k子句。
英文摘要:
This paper describes SatIn, a hardware accelerator for determining boolean satisfiability (SAT) -- an important problem in many domains including verification, security analysis, and planning. SatIn is based on a distributed associative array which performs short, atomic operations that can be composed into high level operations. To overcome scaling limitations imposed by wire delay, we extended the algorithms used in software solvers to function efficiently on a distributed set of nodes communicating with message passing. A cycle-level simulation on real benchmarks shows that SatIn achieves an average 72x speedup against Glucose, the winner of 2016 SAT competition, with the potential to achieve a 113x speedup using two contexts. To quantify SatIn's physical requirements, we placed and routed a single clause using the Synopsys 32nm} educational development kit. We were able to meet a 1ns cycle constraint with our target clause fitting in 4867um^2 and consuming 63.8uW of dynamic power; with a network, this corresponds to 100k clauses consuming 8.3W of dynamic power (not including leakage or global clock power) in a 500mm^2 32nm chip.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。