Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP

  • David Allouche
  • Simon de Givry
  • Thomas Schiex
Conference paper

DOI: 10.1007/978-3-642-15396-9_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6308)
Cite this paper as:
Allouche D., de Givry S., Schiex T. (2010) Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP. In: Cohen D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • David Allouche
    • 1
  • Simon de Givry
    • 1
  • Thomas Schiex
    • 1
  1. 1.Unité de Biométrie et Intelligence Artificielle, UR 875, INRACastanet TolosanFrance

Personalised recommendations