Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Load-balancing methods for parallel constraint solving

In English

Författare

  • 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.

Publiceringsår

2008

Språk

Engelska

Dokumenttyp

Konferensbidrag

Ämne

  • 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

Forskningsgrupp

  • ESDLAB