Parallel consistency in constraint programming
Rolf, Carl Christian LU and Kuchcinski, Krzysztof LU
(2009)
MCC09: Second Swedish Workshop on Multi-Core Computing
- Abstract
- 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... (More) - 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1503903
- author
- Rolf, Carl Christian
LU
and Kuchcinski, Krzysztof
LU
- organization
- publishing date
- 2009
- type
- Contribution to conference
- publication status
- published
- subject
- pages
- 8 pages
- conference name
- MCC09: Second Swedish Workshop on Multi-Core Computing
- conference dates
- 2009-11-26 - 2009-11-27
- language
- English
- LU publication?
- yes
- id
- ec3aa2bf-8cc4-4802-ba31-e08c44320c62 (old id 1503903)
- date added to LUP
- 2016-04-04 13:04:02
- date last changed
- 2025-04-04 15:26:47
@misc{ec3aa2bf-8cc4-4802-ba31-e08c44320c62,
abstract = {{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.<br/><br>
<br/><br>
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.}},
author = {{Rolf, Carl Christian and Kuchcinski, Krzysztof}},
language = {{eng}},
title = {{Parallel consistency in constraint programming}},
url = {{https://lup.lub.lu.se/search/files/6046308/1503904.pdf}},
year = {{2009}},
}