PSATO: a distributed propositional prover and its application to quasigroup problems
Journal of Symbolic Computation - Special issue on parallel symbolic computation
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A machine program for theorem-proving
Communications of the ACM
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
An Efficient Approach to Solving Random k-sat Problems
Journal of Automated Reasoning
Load Sharing in Distributed Systems
IEEE Transactions on Computers
ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
Aiding side-channel attacks on cryptographic software with satisfiability-based analysis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
International Journal of Computational Science and Engineering
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
On multi-threaded satisfiability solving with OpenMP
IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
An overview of parallel SAT solving
Constraints
Learning algorithm portfolios for parallel execution
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
| Hi-index | 0.00 |
The last decade progresses have led the Satisfiability Problem (SAT) to be a great and competitive practical approach to solve a wide range of industrial and academic problems. Thanks to these progresses, the size and difficulty of the SAT instances has grown significantly. Among the recent solvers, a few are parallel and most of them use the message passing paradigm. In a previous work by Vander-Swalmen et al. (IWOMP, 146-157, 2008), we presented a fine grain parallel SAT solver designed for shared memory using OPENMP and named MTSS, for Multi Threaded Sat Solver. MTSS extends the "guiding path" notion and uses a collaborative approach where a rich thread is in charge of the search-tree evaluation and where a set of poor threads yield logical or heuristics information to simplify the rich task. In this paper, we extend the poor thread abilities of MTSS and present extensive comparative results on random 3-SAT problems. These new experimentations show that fine grained techniques associated to poor tasks within the framework of MTSS can achieve very interesting speedup on multi-core processors.