Performance analysis of parallel constraint-based local search
| dc.contributor.author | Caniou, Yves | |
| dc.contributor.author | Diaz, Daniel | |
| dc.contributor.author | Richoux, Florian | |
| dc.contributor.author | Codognet, Philippe | |
| dc.contributor.author | Abreu, Salvador | |
| dc.date.accessioned | 2012-11-30T16:53:53Z | |
| dc.date.available | 2012-11-30T16:53:53Z | |
| dc.date.issued | 2012 | |
| dc.description.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. | por |
| dc.identifier.authoremail | nd | |
| dc.identifier.authoremail | Daniel.Diaz@univ-paris1.fr | |
| dc.identifier.authoremail | nd | |
| dc.identifier.authoremail | nd | |
| dc.identifier.authoremail | spa@di.uevora.pt | |
| dc.identifier.citation | Yves Caniou, Daniel Diaz, Florian Richoux, Philippe Codognet, Salvador Abreu: Performance analysis of parallel constraint-based local search. PPOPP 2012: 337-338 | por |
| dc.identifier.scientificarea | 283 | por |
| dc.identifier.uri | http://doi.acm.org/10.1145/2145816.2145883 | |
| dc.identifier.uri | http://hdl.handle.net/10174/6162 | |
| dc.language.iso | por | por |
| dc.peerreviewed | yes | por |
| dc.publisher | ACM | por |
| dc.rights | restrictedAccess | por |
| dc.title | Performance analysis of parallel constraint-based local search | por |
| dc.type | article | por |