Please use this identifier to cite or link to this item:
http://hdl.handle.net/10174/6162
|
| Title: | Performance analysis of parallel constraint-based local search |
| Authors: | Caniou, Yves
Diaz, Daniel
Richoux, Florian
Codognet, Philippe
Abreu, Salvador |
| Issue Date: | 2012 |
| Publisher: | ACM |
| Citation: | Yves Caniou, Daniel Diaz, Florian Richoux, Philippe Codognet, Salvador Abreu: Performance analysis of parallel constraint-based local search. PPOPP 2012: 337-338 |
| 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 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 (Costas array) shows even better speedups, nearly optimal up to 256 cores. |
| URI: | http://doi.acm.org/10.1145/2145816.2145883
http://hdl.handle.net/10174/6162 |
| Type: | article |
| Appears in Collections: | INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
/
Departamento de Informática /
INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica /
