Performance analysis of parallel constraint-based local search - Université Paris 1 Panthéon-Sorbonne Access content directly
Conference Papers Year : 2012

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.

Dates and versions

hal-00693266 , version 1 (02-05-2012)

Identifiers

Cite

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⟩
210 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More