A Randomized Parallel Backtracking Algorithm
IEEE Transactions on Computers
A randomized parallel branch-and-bound algorithm
International Journal of Parallel Programming
Superlinear speedup for parallel backtracking
Proceedings of the 1st International Conference on Supercomputing
Computational Efficiency of Parallel Combinatorial OR-Tree Searches
IEEE Transactions on Software Engineering
Optimal speedup of Las Vegas algorithms
Information Processing Letters
PSATO: a distributed propositional prover and its application to quasigroup problems
Journal of Symbolic Computation - Special issue on parallel symbolic computation
Anomalies in parallel branch-and-bound algorithms
Communications of the ACM
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Nagging: a scalable fault-tolerant paradigm for distributed search
Artificial Intelligence
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
On the Efficiency of Parallel Backtracking
IEEE Transactions on Parallel and Distributed Systems
Why and How in the ElipSys OR-parallel CLP System
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Optimal Parallelization of Las Vegas Algorithms
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Superlinear Speedup in Parallel State-Space Search
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Improved Branch and Bound in Constraint Logic Programming
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
Journal of Automated Reasoning
A competitive and cooperative approach to propositional satisfiability
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
GridSAT: a system for solving satisfiability problems using a computational grid
Parallel Computing - Optimization on grids - Optimization for grids
Strategies for Solving SAT in Grids by Randomized Search
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
c-sat: A Parallel SAT Solver for Clusters
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Experiments with massively parallel constraint solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Control-based clause sharing in parallel SAT solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Toward Easy Parallel SAT Solving
ICTAI '09 Proceedings of the 2009 21st IEEE International Conference on Tools with Artificial Intelligence
Partitioning Search Spaces of a Randomized Search
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Partitioning SAT instances for distributed solving
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A distribution method for solving SAT in grids
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Grid-based SAT solving with iterative partitioning and clause learning
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Designing scalable parallel SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
Asynchronous multi-core incremental SAT solving
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Concurrent clause strengthening
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
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.