Gent, Ian Philip, McCreesh, Ciaran, Miguel, Ian James et al. (4 more authors) (2018) A review of literature on parallel constraint solving. Theory and Practice of Logic Programming. pp. 725-758. ISSN 1475-3081
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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 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. |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 23 Jan 2019 16:30 |
Last Modified: | 16 Oct 2024 15:03 |
Status: | Published |
Refereed: | Yes |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:141507 |
Download
Filename: tplp_parallel_review_2018.pdf
Description: tplp-parallel-review-2018