Abstract
In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication between parallel running computations are limited.We study analytically an approach where the instance is partitioned iteratively into a tree of subproblems and each node in the tree is solved in parallel.We present new methods for constructing partitions which combine clause learning and lookahead. The methods are incorporated into the iterative approach and its performance is demonstrated with an extensive comparison against the best sequential solvers in the SAT competition 2009 as well as against two efficient parallel solvers. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Hyvärinen, A. E. J., Junttila, T., & Niemelä, I. (2010). Partitioning SAT instances for distributed solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6397 LNCS, pp. 372–386). Springer Verlag. https://doi.org/10.1007/978-3-642-16242-8_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
