Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI

Authors:
Daniel Singer;Alain Vagner
Affiliations:
LITA – EA 3097, Université Paul Verlaine de Metz, UFR MIM, Metz, France;LITA – EA 3097, Université Paul Verlaine de Metz, UFR MIM, Metz, France
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 12
Cited 1

PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
MPI: The Complete Reference

MPI: The Complete Reference
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
The Langford's Problem: A Challenge for Parallel Resolution of CSP

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Parallel heuristic search in Haskell

Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00)
SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Parallel propositional satisfiability checking with distributed dynamic learning

Parallel Computing
GridSAT: A Chaff-based Distributed SAT Solver for the Grid

Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study

International Journal of Computational Science and Engineering
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

JaCk-SAT: a new parallel scheme to solve the satisfiability problem (SAT) based on join-and-check

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The past few years have seen enormous progress in the performance of propositional satisfiability (SAT) solving, and consequently SAT solvers are widely used in industry for many applications. In spite of this progress, there is strong demand for higher SAT algorithms efficiency to solve harder and larger problems. Unfortunately, most modern solvers are sequential and fewer are parallel. A number of recent propositions was concerned with dynamic workload balancing for parallel SAT solving. Here, it is a complementary approach that only explores an initial static decomposition for workload repartition. The two computational models of Shared Memory and Message Passing are compared, using OpenMP for Shared Memory and MPI for Message Passing implementations.