Gent, I. P., Miguel, I., Nightingale, P., McCreesh, C. , Prosser, P. , Moore, N. C.A. and Unsworth, C. (2018) A review of literature on parallel constraint solving. Theory and Practice of Logic Programming, 18(5-6), pp. 725-758. (doi: 10.1017/S1471068418000340)
|
Text
171801.pdf - Accepted Version 690kB |
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.
Item Type: | Articles |
---|---|
Additional Information: | The authors would like to thank EPSRC for funding this work through grants EP/E030394/1, EP/M003728/1, EP/P015638/1 and EP/P026842/1. |
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Mccreesh, Dr Ciaran and Unsworth, Dr Chris and Prosser, Dr Patrick |
Authors: | Gent, I. P., Miguel, I., Nightingale, P., McCreesh, C., Prosser, P., Moore, N. C.A., and Unsworth, C. |
College/School: | College of Science and Engineering > School of Computing Science |
Journal Name: | Theory and Practice of Logic Programming |
Publisher: | Cambridge University Press |
ISSN: | 1471-0684 |
ISSN (Online): | 1475-3081 |
Published Online: | 02 August 2018 |
Copyright Holders: | Copyright © 2018 Cambridge University Press |
First Published: | First published in Theory and Practice of Logic Programming 18(5-6): 725-758 |
Publisher Policy: | Reproduced in accordance with the publisher copyright policy |
Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record