A review of literature on parallel constraint solving
MetadataShow full item record
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.
Gent , I P , Miguel , I J , Nightingale , P W , McCreesh , C , Prosser , P , Moore , N & Unsworth , C 2018 , ' A review of literature on parallel constraint solving ' Theory and Practice of Logic Programming , vol. 18 , no. 5-6 , pp. 725-758 . DOI: 10.1017/S1471068418000340
Theory and Practice of Logic Programming
© 2018, Cambridge University Press. This work has been made available online in accordance with the publisher’s policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1017/S1471068418000340
DescriptionFunding: UK Engineering & Physical Sciences Research Council (EPSRC) EP/E030394/1, EP/M003728/1, EP/P015638/1, and EP/P026842/1.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.