Load-balancing methods for parallel constraint solving
(2008) International Conference on Principles and Practice of Constraint Programming: Doctoral Program- Abstract
- Program parallelization becomes increasingly important when new parallel and multi-core architectures provide ways to improve performance. In this paper, we address parallel search in constraint programming (CP) by proposing several load-balancing methods. We show how these methods improve the execution-time scalability of constraint programs. Scalability is the greatest challenge of parallelism and it is particularly an issue in constraint programming, where load-balancing is difficult. We address this problem by proposing CP-specific load-balancing methods and evaluating them using benchmark problems. Our experimental results show that the methods behave differently well depending on the type of problem.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1368836
- author
- Rolf, Carl Christian LU and Kuchcinski, Krzysztof LU
- organization
- publishing date
- 2008
- type
- Contribution to conference
- publication status
- published
- subject
- conference name
- International Conference on Principles and Practice of Constraint Programming: Doctoral Program
- conference location
- Sydney, Australia
- conference dates
- 2008-09-14 - 2008-09-18
- language
- English
- LU publication?
- yes
- id
- ebd35630-9c48-4a0c-b02d-ceb18960e627 (old id 1368836)
- date added to LUP
- 2016-04-04 13:13:02
- date last changed
- 2021-05-06 20:22:41
@misc{ebd35630-9c48-4a0c-b02d-ceb18960e627, abstract = {{Program parallelization becomes increasingly important when new parallel and multi-core architectures provide ways to improve performance. In this paper, we address parallel search in constraint programming (CP) by proposing several load-balancing methods. We show how these methods improve the execution-time scalability of constraint programs. Scalability is the greatest challenge of parallelism and it is particularly an issue in constraint programming, where load-balancing is difficult. We address this problem by proposing CP-specific load-balancing methods and evaluating them using benchmark problems. Our experimental results show that the methods behave differently well depending on the type of problem.}}, author = {{Rolf, Carl Christian and Kuchcinski, Krzysztof}}, language = {{eng}}, title = {{Load-balancing methods for parallel constraint solving}}, url = {{https://lup.lub.lu.se/search/files/6072275/1368837.pdf}}, year = {{2008}}, }