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.

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. Using 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 previously focused on data parallelism. In this paper, we look at task parallelism, specifically the case of parallel consistency. We have developed two models of parallel consistency, one that shares intermediate results and one that does not. We evaluate which model is better in our experiments. Our results show that parallelizing consistency can provide the programmer with a robust scalability for regular problems with global constraints.

Publishing year

2009

Language

English

Document type

Conference paper

Topic

  • Computer Science

Conference name

MCC09: Second Swedish Workshop on Multi-Core Computing

Conference date

2009-11-26 - 2009-11-27

Status

Published

Research group

  • ESDLAB