Skip to Main content Skip to Navigation
Conference papers

Towards parallel non serial dynamic programming for solving hard weighted CSP

Abstract : We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost functions in a tree of collection of functions called clusters. By processing the tree from the leaves up to the root, we solve each cluster concurrently, for each assignment of its separator, using a state-of-the-art exact sequential algorithm. The grain of parallelism obtained in this way is directly related to the tree decomposition used. We use a dedicated strategy for building suitable decompositions. We present preliminary results of our prototype running on a cluster with hundreds of cores on different decomposable real problems. This implementation allowed us to solve the last open CELAR radio link frequency assignment instance to optimality.
Document type :
Conference papers
Complete list of metadata
Contributor : Migration ProdInra Connect in order to contact the contributor
Submitted on : Wednesday, June 3, 2020 - 7:49:42 PM
Last modification on : Thursday, March 17, 2022 - 1:44:02 PM

Links full text




David Allouche, Simon de Givry, Thomas Schiex. Towards parallel non serial dynamic programming for solving hard weighted CSP. 16th Annual International Conference on the Principles and Practice of Constraint Programming, Sep 2010, St. Andrews, Scotland, United Kingdom. pp.8, ⟨10.1007/978-3-642-15396-9_7⟩. ⟨hal-02753702⟩



Record views