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.
- E. Alba. Special issue on new advances on parallel meta-heuristics for complex problems. Journal of Heuristics, 10(3):239--380, 2004. Google Scholar
Digital Library
- Y. Caniou, P. Codognet, D. Diaz, and S. Abreu. Experiments in parallel constraint-based local search. In EvoCOP11, 11th European Conference on Evolutionary Computation in Combinatorial Optimisation, LNCS 6622, pages 96--107. Springer Verlag, 2011. Google Scholar
Digital Library
- P. Codognet and D. Diaz. Yet another local search method for constraint solving. In proceedings of SAGA'01, pages 73--90. Springer Verlag, 2001. Google Scholar
Digital Library
- P. Codognet and D. Diaz. An efficient library for solving CSP with local search. In T. Ibaraki, editor, MIC'03, 5th International Conference on Metaheuristics, 2003.Google Scholar
- T. Crainic and M. Toulouse. Special issue on parallel meta-heuristics. Journal of Heuristics, 8(3):247--388, 2002. Google Scholar
Digital Library
- K. Drakakis. A review of costas arrays. Journal of Applied Mathematics, 2006:1--32, 2006.Google Scholar
Cross Ref
- I. P. Gent and T.Walsh. CSPLIB: A benchmark library for constraints. In proceedings of CP'99, pages 480--481. Springer Verlag, 1999. Google Scholar
Digital Library
- T. Gonzalez, editor. Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall / CRC, 2007. Google Scholar
Digital Library
- P. V. Hentenryck and L. Michel. Constraint-Based Local Search. The MIT Press, 2005. Google Scholar
Digital Library
- T. Ibaraki, K. Nonobe, and M. Yagiura, editors. Metaheuristics: Progress as Real Problem Solvers. Springer Verlag, 2005.Google Scholar
- S. Kadioglu and M. Sellmann. Dialectic search. In CP'09, Int. Conf. on Principles and Practice of Constraint Programming. Springer Verlag, 2009. Google Scholar
Digital Library
- M. Verhoeven and E. Aarts. Parallel local search. Journal of Heuristics, 1(1):43--65, 1995.Google Scholar
Cross Ref
Index Terms
Performance analysis of parallel constraint-based local search
Recommendations
Performance analysis of parallel constraint-based local search
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel ProgrammingWe 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 ...
A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
We propose a new neighborhood structure for the problem. The results demonstrate that our neighborhood structure is better than the current ones, and it has the additional benefit that it can be explored using a GPU-based massively parallel ...
Local search algorithms for the k-cardinality tree problem
In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for efficient methods to obtain good solutions. We review ...







Comments