Affiliations: Aalto University, Department of Information and Computer Science, P.0.Box 15400, FI-00076 AALTO, Finland. Antti.Hyvarinen@tkk.fi; Tommi.Junttila@tkk.fi; Ilkka.Niemela@tkk.fi
Note: [] Address for correspondence: Aalto University, Department of Information and Computer Science, P.0.Box 15400, FI-00076 AALTO, Finland
Abstract: This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what is the best way to use the computers to solve the instance? Two approaches, simple distribution and search space partitioning as well as their combinations are investigated both analytically and empirically. It is shown that the results depend heavily on the type of the problem (unsatisfiable, satisfiable with few solutions, and satisfiable with many solutions) as well as on how good the search space partitioning function is. In addition, the behavior of a real search space partitioning function is evaluated in the same framework. The results suggest that in practice one should combine the simple distribution and search space partitioning approaches.
Keywords: SAT solving, Randomized search, Distributed constraint-based search
