The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Combining parallel search and parallel consistency in constraint programming

På svenska

Author

  • Carl Christian Rolf
  • Krzysztof Kuchcinski

Summary, in English

Program parallelization becomes increasingly important when new multi-core architectures provide ways to improve performance. One of the greatest challenges of this development lies in programming parallel applications. Declarative languages, such as constraint programming, can make the transition to parallelism easier by hiding the parallelization details in a framework.



Automatic parallelization in constraint programming has mostly focused on parallel search. While search and consistency are intrinsically linked, the consistency part of the solving process is often more time-consuming. We have previously looked at parallel consistency and found it to be quite promising. In this paper we investigate how to combine parallel search with parallel consistency. We evaluate which problems are suitable and which are not. Our results show that parallelizing the entire solving process in constraint programming is a major challenge as parallel search and parallel consistency typically suit different types of problems.

Publishing year

2010

Language

English

Document type

Conference paper

Topic

  • Computer Science

Conference name

TRICS workshop at the International Conference on Principles and Practice of Constraint Programming

Conference date

2010-09-06 - 2010-09-10

Status

Published

Research group

  • ESDLAB