Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Criticality and Parallelism in Structured SAT Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
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
GridSAT: a system for solving satisfiability problems using a computational grid
Parallel Computing - Optimization on grids - Optimization for grids
Additive versus multiplicative clause weighting for SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Integrating systematic and local search paradigms: a new strategy for MaxSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Evidence for invariants in local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Restart strategies in optimization: parallel and serial cases
Parallel Computing
Captain Jack: new variable selection heuristics in local search for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Random walk with continuously smoothed variable weights
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Improving stochastic local search for SAT with a new probability distribution
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Improving parallel local search for SAT
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
An overview of parallel SAT solving
Constraints
Massively Parallel Local Search for SAT
ICTAI '12 Proceedings of the 2012 IEEE 24th International Conference on Tools with Artificial Intelligence - Volume 01
| Hi-index | 0.00 |
In the domain of propositional Satisfiability Problem (SAT), parallel portfolio-based algorithms have become a standard methodology for both complete and incomplete solvers. In this methodology several algorithms explore the search space in parallel, either independently or cooperatively with some communication between the solvers. We conducted a study of the scalability of several SAT solvers in different application domains (crafted, verification, quasigroups and random instances) when drastically increasing the number of cores in the portfolio, up to 512 cores. Our experiments show that on different problem families the behaviors of different solvers vary greatly. We present an empirical study that suggests that the best sequential solver is not necessary the one with the overall best parallel speedup.