Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI

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