Performance analysis of parallel constraint-based local search

Authors:
Yves Caniou;Daniel Diaz;Florian Richoux;Philippe Codognet;Salvador Abreu
Affiliations:
JFLI, CNRS / NII, Tokyo, Japan;University of Paris 1-Sorbonne, Paris, France;JFLI, CNRS / University of Tokyo, Tokyo, Japan;JFLI, CNRS / UPMC / University of Tokyo, Tokyo, Japan;Universidade de Evora and CENTRIA FCT/UNL, Evora, Portugal
Venue:
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Year:
2012

Citing 8
Cited 1

Introduction to the Special Issue on Parallel Meta-Heuristics

Journal of Heuristics
Yet Another Local Search Method for Constraint Solving

SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
CSPLIB: A Benchmark Library for Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Introduction

Journal of Heuristics
Constraint-Based Local Search

Constraint-Based Local Search
Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series)

Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series)
Dialectic search

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Experiments in parallel constraint-based local search

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization

Multiverse: efficiently supporting distributed high-level speculation

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

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.