By the same authors

From the same journal

A review of literature on parallel constraint solving

Research output: Contribution to journalArticle

Full text download(s)

Author(s)

Department/unit(s)

Publication details

JournalTheory and Practice of Logic Programming
DateAccepted/In press - 30 Apr 2018
DateE-pub ahead of print - 2 Aug 2018
DatePublished (current) - Sep 2018
Issue number5-6
Volume18
Number of pages34
Pages (from-to)725-758
Early online date2/08/18
Original languageEnglish

Abstract

As multicore 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 multicore 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.

Bibliographical note

© Cambridge University Press, 2018 . This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.

Funding: UK Engineering & Physical Sciences Research Council (EPSRC) EP/E030394/1, EP/M003728/1, EP/P015638/1, and EP/P026842/1.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations