A review of literature on parallel constraint solving

Ian Philip Gent, Ian James Miguel, Peter William Nightingale, Ciaran McCreesh, Patrick Prosser, Neil Moore, Chris Unsworth

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)
2 Downloads (Pure)


As multi-core computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search. We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution. Yet there seems to be little overall guidance that can be given on how best to exploit multi-core computers to speed up constraint solving. We hope at least that this survey will provide useful pointers to future researchers wishing to correct this situation.
Original languageEnglish
Pages (from-to)725-758
Number of pages34
JournalTheory and Practice of Logic Programming
Issue number5-6
Early online date2 Aug 2018
Publication statusPublished - Sept 2018


  • Constraint programming
  • Parallel computing
  • Propositional satisfiability
  • Parallel search


Dive into the research topics of 'A review of literature on parallel constraint solving'. Together they form a unique fingerprint.

Cite this