NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Search Procedures and Parallelism in Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Scalable Distributed Depth-First Search with Greedy Work Stealing
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Transparent Parallelization of Constraint Programming
INFORMS Journal on Computing
Model counting: a new strategy for obtaining good bounds
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Service-Oriented volunteer computing for massively parallel constraint solving using portfolios
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Massively parallel constraint programming for supercomputers: challenges and initial results
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An overview of parallel SAT solving
Constraints
Scalable parallel interval propagation for sparse constraint satisfaction problems
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Partitioning Search Spaces of a Randomized Search
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
A hybrid paradigm for adaptive parallel search
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Learning algorithm portfolios for parallel execution
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Thread-based multi-engine model checking for multicore platforms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hi-index | 0.00 |
The computing industry is currently facing a major architectural shift. Extra computing power is not coming anymore from higher processor frequencies, but from a growing number of computing cores and processors. For AI, and constraint solving in particular, this raises the question of how to scale current solving techniques to massively parallel architectures. While prior work focusses mostly on small scale parallel constraint solving, we conduct the first study on scalability of constraint solving on 100 processors and beyond in this paper. We propose techniques that are simple to apply and show empirically that they scale surprisingly well. These techniques establish a performance baseline for parallel constraint solving technologies against which more sophisticated parallel algorithms need to compete in the future.