Please use this identifier to cite or link to this item:

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.
Type: article
Appears in Collections:INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica

Files in This Item:

File Description SizeFormat
PPoPP12-final.pdf105.37 kBAdobe PDFView/OpenRestrict Access. You can Request a copy!
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois