Combining parallel search and parallel consistency in constraint programming
(2010) TRICS workshop at the International Conference on Principles and Practice of Constraint Programming- 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. 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... (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. 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1687279
- author
- Rolf, Carl Christian LU and Kuchcinski, Krzysztof LU
- organization
- publishing date
- 2010
- type
- Contribution to conference
- publication status
- published
- subject
- pages
- 15 pages
- conference name
- TRICS workshop at the International Conference on Principles and Practice of Constraint Programming
- conference dates
- 2010-09-06 - 2010-09-10
- language
- English
- LU publication?
- yes
- id
- 1318f0f6-c09a-432e-972f-a1b1c46dd0bf (old id 1687279)
- date added to LUP
- 2016-04-04 13:40:42
- date last changed
- 2021-05-05 10:45:55
@misc{1318f0f6-c09a-432e-972f-a1b1c46dd0bf, 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. 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 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.}}, author = {{Rolf, Carl Christian and Kuchcinski, Krzysztof}}, language = {{eng}}, title = {{Combining parallel search and parallel consistency in constraint programming}}, url = {{https://lup.lub.lu.se/search/files/6178866/1687280.pdf}}, year = {{2010}}, }