Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Parallel consistency in constraint programming

Författare

  • 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.

Publiceringsår

2009

Språk

Engelska

Dokumenttyp

Konferensbidrag

Ämne

  • Computer Science

Conference name

MCC09: Second Swedish Workshop on Multi-Core Computing

Conference date

2009-11-26 - 2009-11-27

Status

Published

Forskningsgrupp

  • ESDLAB