基于硬件加速器的稠密图划分
Partitioning Dense Graphs with Hardware Accelerators
摘要:
图划分问题是一个基本的组合优化问题,由于其广泛的应用而引起了理论界和实践界的广泛关注。从多层次图划分到更通用的优化求解器,如Guesthouse和CPLEX,已经开发了各种各样的方法。这些方法的局限性是重要的研究,以打破这个问题的计算优化障碍。当我们接近摩尔定律的极限时,现在需要探索用量子计算机或量子加速器等专用硬件解决这些问题的方法。在这项工作中,我们的实验解决图形划分的富士通数字退火机(一种专用硬件设计用于解决组合优化问题),并将其与现有的顶级求解器。我们证明了现有的求解器在许多密集图上的局限性,以及稀疏图上的数字退火器的局限性,这为混合这些方法开辟了一条途径。
英文摘要:
Graph partitioning is a fundamental combinatorial optimization problem that attracts a lot of attention from theoreticians and practitioners due to its broad applications. From multilevel graph partitioning to more general-purpose optimization solvers such as Gurobi and CPLEX, a wide range of approaches have been developed. Limitations of these approaches are important to study in order to break the computational optimization barriers of this problem. As we approach the limits of Moore's law, there is now a need to explore ways of solving such problems with special-purpose hardware such as quantum computers or quantum-inspired accelerators. In this work, we experiment with solving the graph partitioning on the Fujitsu Digital Annealer (a special-purpose hardware designed for solving combinatorial optimization problems) and compare it with the existing top solvers. We demonstrate limitations of existing solvers on many dense graphs as well as those of the Digital Annealer on sparse graphs which opens an avenue to hybridize these approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。