The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Load-balancing methods for parallel constraint solving

På svenska

Author

  • Carl Christian Rolf
  • Krzysztof Kuchcinski

Summary, in English

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.

Publishing year

2008

Language

English

Document type

Conference paper

Topic

  • Computer Science

Conference name

International Conference on Principles and Practice of Constraint Programming: Doctoral Program

Conference date

2008-09-14 - 2008-09-18

Conference place

Sydney, Australia

Status

Published

Research group

  • ESDLAB