4 documents found, page 1 of 1
Large-scale parallelism for constraint-based local search: the costas array cas...
Caniou, Yves; Codognet, Philippe; Richoux, Florian; Diaz, Daniel; Abreu, SalvadorWe present the parallel implementation of a constraint-based Local Search algorithm and investigate its performance on several hardware platforms with several hundreds or thousands of cores. We chose as the basis for these experiments the Adaptive Search method, an efficient sequential Local Search method for Constraint Satisfaction Problems (CSP). After preliminary experiments on some CSPLib benchmarks, we det...
Parallel Local Search for the Costas Array Problem
Diaz, Daniel; Richoux, Florian; Caniou, Yves; Codognet, Philippe; Abreu, SalvadorThe Costas Array Problem is a highly combina- torial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implementations, ...
Constraint-Based Local Search for the Costas Array Problem
Diaz, Daniel; Richoux, Florian; Codognet, Philippe; Caniou, Yves; Abreu, SalvadorTheCostasArrayProblemisahighlycombinatorialproblem linked to radar applications. We present in this paper its detailed mod- eling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implemen- tations, while ...
Performance analysis of parallel constraint-based local search
Caniou, Yves; Diaz, Daniel; Richoux, Florian; Codognet, Philippe; Abreu, SalvadorWe 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 bench- marks, speedups are very good for a few tens of cores, and good up to a hundred cores. More challenging problems derived from real- life applications...