Parallel SAT Solver Selection and Scheduling
Parallel SAT Solver Selection and Scheduling
复制标题
并行 SAT 求解器选择和调度
DOI：
10.1007/978-3-642-33558-7_38
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Meinolf Sellmann
中科院分区：
文献类型：
--
作者：
Y. Malitsky;Ashish Sabharwal;Horst Samulowitz;Meinolf Sellmann
通过求解器组合组合来组合不同的求解方法已被证明是提高求解器性能的一种非常有效的技术。我们考虑的问题，产生并行SAT求解器组合。我们的方法是基于最近推出的顺序SAT求解器组合，在最后SAT比赛中表现出色。我们展示了如何可以推广的并行情况下的方法，以及如何可以克服的障碍，如并行SAT求解器和相同的处理器引起的对称性。我们比较了不同的方法来计算并行求解器的投资组合与最好的并行SAT方法。大量的实验结果表明，开发的方法非常显着提高我们目前的并行SAT求解能力。
Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition. We show how the approach can be generalized for the parallel case, and how obstacles like parallel SAT solvers and symmetries induced by identical processors can be overcome. We compare different ways of computing parallel solver portfolios with the best performing parallel SAT approaches to date. Extensive experimental results show that the developed methodology very significantly improves our current parallel SAT solving capabilities.