TL;DR本研究探讨了在大规模并行 SAT 问题求解中应用基于投资组合的分布式 SAT 求解方法,并实现了一个名为 HordeSat 的可扩展的并行 SAT 求解器,其使用分层并行和分布式设计,实现了数百到数千个处理器的可观加速效果。
Abstract
A simple yet successful approach to parallel satisfiability (SAT) solving is
to run several different (a portfolio of) SAT solvers on the input problem at
the same time until one solver finds a solution. The SAT solvers in the
portfolio can be instances of a single solver with different configuration
settings. Additionally the solvers can exchange informatio
Configurable SAT Solver Competition (CSSC) compares solvers by the performance they achieved after a fully automated configuration step to solve combinatorial problems, particularly propositional satisfiability problem (SAT), by tuning solver parameters, with CSSC 2013 and 2014 being reported.