Large-scale parallelism for constraint-based local search: the costas array case study

• Author(s): Caniou, Yves ; Codognet, Philippe ; Richoux, Florian ; Diaz, Daniel ; Abreu, Salvador
• Date: 2016
• Persistent ID: http://hdl.handle.net/10174/17245
• Origin: Repositório Científico da Universidade de Évora
• Document Type: Journal article
• Language: Portuguese

Description

We 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 detail the modeling and solving of a hard combinatorial problem related to radar and sonar applications: the Costas Array Problem. Performance evaluation on some classical CSP benchmarks shows that speedups are very good for a few tens of cores, and good up to a few hundreds of cores. However for a hard combinatorial search problem such as the Costas Array Problem, performance evaluation of the sequential version shows results outperforming previous Local Search implementations, while the parallel version shows nearly linear speedups up to 8,192 cores. The proposed parallel scheme is simple and based on independent multi-walks with no communication between processes during search. We also investigated a cooperative multi-walk scheme where processes share simple information, but this scheme does not seem to improve performance.