Parallelizing constraint programs

The availability of commodity multi-core and multi-processor machinesandtheinherentparallelisminconstraintprogrammingsearchoffer significant opportunities for constraint programming. They also present a fundamental challenge: how to exploit parallelism transparently to speed up constraintprograms.Thispapershowshowtoparallelizeconstraintprograms 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. Experimentalresultsshowthattheparallelimplementation may producessignificant speedups on multi-core machines.

• Type: Conference
• Year: 2010
• Where: POPL
• Authors: Laurent D. Michel
• Keywords: Multi-core, Multi-processor Machinesandtheinherentparallelisminconstraintprogrammingsearchoffer Significant, POPL 2010, Sequential Exploration Strategy