Parallel consistency in constraint programming

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.

• Author: Carl Christian Rolf; Krzysztof Kuchcinski
• Editor: Hamid R Arabnia
• Department/s: Department of Computer Science; Parallel Systems
• Publishing year: 2009
• Language: English
• Pages: 638-644
• Publication/Series: Proceedings of the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2009 : [at] WORLDCOMP'09, July 13 - 16, 2009, Las Vegas Nevada, USA
• Document type: Conference paper
• Publisher: CSREA Press
• Topic: Computer Science
• Conference name: Third International Workshop on Scalable Distributed and Multi/Many-core Applications and Systems (SDMAS'09) within PDPTA'09
• Conference date: 2009-07-13 - 2009-07-16
• Conference place: Las Vegas, United States
• Status: Published
• Research group: ESDLAB
• ISBN/ISSN/Other: ISBN: 1601321236