Skip to Main content Skip to Navigation
Conference papers

Performance analysis of parallel constraint-based local search

Abstract : We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results for hard combinatorial optimization problems on two different platforms up to several hundreds of cores. On a variety of classical CSPs benchmarks, speedups are very good for a few tens of cores, and good up to a hundred cores. More challenging problems derived from reallife applications (Costas array) shows even better speedups, nearly optimal up to 256 cores.
Complete list of metadata
Contributor : Daniel Diaz <>
Submitted on : Wednesday, May 2, 2012 - 11:59:55 AM
Last modification on : Saturday, September 11, 2021 - 3:18:16 AM

Links full text



Yves Caniou, Daniel Diaz, Florian Richoux, Philippe Codognet, Salvador Abreu. Performance analysis of parallel constraint-based local search. Principles and Practice of Parallel Programming, Feb 2012, New Orleans, United States. pp.337-338, ⟨10.1145/2145816.2145883⟩. ⟨hal-00693266⟩



Record views