Parallel CLP on heterogeneous networks
Proceedings of the eleventh international conference on Logic programming
Search Procedures and Parallelism in Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Components for State Restoration in Tree Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A decomposition-based implementation of search strategies
ACM Transactions on Computational Logic (TOCL)
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Nondeterministic control for hybrid search
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Protein Structure Prediction with Large Neighborhood Constraint Programming Search
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Parallel and distributed local search in COMET
Computers and Operations Research
Computer Languages, Systems and Structures
Optimal deployment of eventually-serializable data services
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Confidence-based work stealing in parallel constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Load balancing and almost symmetries for RAMBO quorum hosting
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Partitioning SAT instances for distributed solving
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Parallel constraint-based local search on the HA8000 supercomputer (abstract)
Proceedings of the 2011 ACM Symposium on Applied Computing
Experiments in parallel constraint-based local search
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
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
On Lattice Protein Structure Prediction Revisited
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Targeting the Cell Broadband Engine for constraint-based local search
Concurrency and Computation: Practice & Experience
A hybrid paradigm for adaptive parallel search
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
The availability of commodity multi-core andmulti-processor machines and the inherent parallelism inconstraint programming search offer significant opportunities for constraint programming. They also present a fundamental challenge: how to exploit parallelism transparently to speed up constraint programs. This paper shows how to parallelize constraint programs transparently without changes to the code. The main technical idea consists of automatically lifting a sequential exploration strategy into its parallel counterpart, allowing workers to share and steal subproblems. Experimental results showthat the parallel implementationmay produces significant speedups on multi-core machines.