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

Title: Experiments in Parallel Constraint-Based Local Search
Authors: Caniou, Yves
Codognet, Philippe
Diaz, Daniel
Abreu, Salvador
Editors: Merz, Peter
Hao, Jin-Kao
Keywords: Constraint Satisfaction
Parallel Computation
Issue Date: 2011
Citation: Yves Caniou and Philippe Codognet and Daniel Diaz and Salvador Abreu, Experiments in Parallel Constraint-Based Local Search, , Evolutionary Computation in Combinatorial Optimization - 11th European Conference (EvoCOP 2011), LNCS, Springer, Vol. 6622, Pag. 96-107, 2011.
Abstract: We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hardware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the ”adaptive search” method, an efficient sequential local search method for Constraint Satisfaction Problems. The implemented algorithm is a parallel version of adaptive search in a multiple independent-walk manner, that is, each process is an independent search engine and there is no communication between the simultaneous computations. Preliminary performance evaluation on a variety of classical CSPs benchmarks shows that speedups are very good for a few tens of processors, and good up to a few hundreds of processors.
Type: article
Appears in Collections:INF - Artigos em Livros de Actas/Proceedings

Files in This Item:

File Description SizeFormat
EvoCOP11-published.pdf416.38 kBAdobe PDFView/Open
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