当前位置: X-MOL 学术arXiv.cs.ET › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An Oscillator-based MaxSAT solver
arXiv - CS - Emerging Technologies Pub Date : 2021-09-21 , DOI: arxiv-2109.09897
Mohammad Khairul Bashar, Jaykumar Vaidya, Antik Mallick, R S Surya Kanthi, Shamiul Alam, Nazmul Amin, Chonghan Lee, Feng Shi, Ahmedullah Aziz, Vijaykrishnan Narayanan, Nikhil Shukla

The quest to solve hard combinatorial optimization problems efficiently -- still a longstanding challenge for traditional digital computers -- has inspired the exploration of many alternate computing models and platforms. As a case in point, oscillator networks offer a potentially promising energy efficient and scalable option. However, prior oscillator-based combinatorial optimization solvers have primarily focused on quadratic combinatorial optimization problems that consider only pairwise interaction among the oscillators. In this work, we propose a new computational model based on the maximum entropy production (MEP) principle that exploits higher order interactions among the oscillators, and demonstrate its application in solving the non-quadratic maximum satisfiability (MaxSAT) problem. We demonstrate that the solution to the MaxSAT problem can be directly mapped to the entropy production rate in the oscillator network, and subsequently, propose an area-efficient hardware implementation that leverages Compute-in-Memory (CiM) primitives. Using experiments along with analytical and circuit simulations, we elucidate the performance of the proposed approach in computing high-quality optimal / near-optimal solutions to the MaxSAT problem. Our work not only reveals how oscillators can solve non-quadratic combinatorial optimization problems such as MaxSAT but also extends the application of this dynamical system-based approach to a broader class of problems that can be easily decomposed to the MaxSAT solution.

中文翻译:

基于振荡器的 MaxSAT 求解器

对有效解决硬组合优化问题的追求——对传统数字计算机来说仍然是一个长期的挑战——激发了对许多替代计算模型和平台的探索。例如,振荡器网络提供了一种潜在的节能和可扩展选项。然而,先前的基于振荡器的组合优化求解器主要关注仅考虑振荡器之间的成对交互的二次组合优化问题。在这项工作中,我们提出了一种基于最大熵产生 (MEP) 原理的新计算模型,该模型利用振荡器之间的高阶相互作用,并展示了其在解决非二次最大可满足性 (MaxSAT) 问题中的应用。我们证明了 MaxSAT 问题的解决方案可以直接映射到振荡器网络中的熵产生率,随后,提出了一种利用内存计算 (CiM) 原语的区域高效硬件实现。使用实验以及分析和电路模拟,我们阐明了所提出的方法在计算 MaxSAT 问题的高质量最优/接近最优解方面的性能。我们的工作不仅揭示了振荡器如何解决非二次组合优化问题,如 MaxSAT,而且还将这种基于动态系统的方法的应用扩展到更广泛的问题类别,这些问题可以轻松分解为 MaxSAT 解决方案。提出了一种利用内存中计算 (CiM) 原语的区域高效硬件实现。使用实验以及分析和电路模拟,我们阐明了所提出的方法在计算 MaxSAT 问题的高质量最优/接近最优解方面的性能。我们的工作不仅揭示了振荡器如何解决非二次组合优化问题,如 MaxSAT,而且还将这种基于动态系统的方法的应用扩展到更广泛的问题类别,这些问题可以轻松分解为 MaxSAT 解决方案。提出一种利用内存中计算 (CiM) 原语的区域高效硬件实现。使用实验以及分析和电路模拟,我们阐明了所提出的方法在计算 MaxSAT 问题的高质量最优/接近最优解方面的性能。我们的工作不仅揭示了振荡器如何解决非二次组合优化问题,如 MaxSAT,而且还将这种基于动态系统的方法的应用扩展到更广泛的问题类别,这些问题可以轻松分解为 MaxSAT 解决方案。
更新日期:2021-09-22
down
wechat
bug