A Massively Parallel Combinatorial Optimization Algorithm for the Costas Array Problem

For a few decades the family of Local Search methods and Metaheuristics has been quite successful in solving large real-life problems. Applying Local Search to Constraint Satisfaction Problems (CSPs) has also been attracting some interest as it can tackle CSPs instances far beyond the reach of classical propagation-based solvers. In this research we address the issue of parallelizing constraint solvers for massively parallel architectures, with the aim of tackling platforms with several thousands of CPUs. A design principle implied by this goal is to abandon the classical model of shared data structures which have been developed for shared-memory architectures or tightly controlled master-slave communication in cluster-based architectures and to first consider either purely independent parallelism or very limited communication between parallel processes, and then to see if we can improve runtime performance using some form of communication.

[1]  Pascal Van Hentenryck,et al.  Distributed Constraint-Based Local Search , 2006, CP.

[2]  Jean-Charles Régin,et al.  Embarrassingly Parallel Search , 2013, CP.

[3]  Philippe Codognet,et al.  Large-scale parallelism for constraint-based local search: the costas array case study , 2014, Constraints.

[4]  Lucas Bordeaux,et al.  Experiments with Massively Parallel Constraint Solving , 2009, IJCAI.

[5]  Philippe Codognet,et al.  An Efficient Library for Solving CSP with Local Search , 2003 .

[6]  Philippe Codognet,et al.  Parallel Local Search for the Costas Array Problem , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

[7]  Andrew J. Davenport,et al.  Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results , 2010, CPAIOR.

[8]  Satoshi Matsuoka,et al.  Grid'BnB : A Parallel Branch and Bound Framework for Grids , 2007, HiPC.

[9]  Philippe Codognet,et al.  Constraint-Based Local Search for the Costas Array Problem , 2012, LION.

[10]  Philippe Codognet,et al.  Yet Another Local Search Method for Constraint Solving , 2001, SAGA.

[11]  Philippe Codognet,et al.  Performance analysis of parallel constraint-based local search , 2012, PPoPP '12.

[12]  Martin Burtscher,et al.  The Future of Accelerator Programming: Abstraction, Performance or Can We Have Both? , 2013, ICPADS.

[13]  Philippe Codognet,et al.  Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture , 2010, IDC.

[14]  Claude-Guy Quimper,et al.  Parallel Discrepancy-Based Search , 2013, CP.

[15]  Philippe Codognet,et al.  Prediction of Parallel Speed-Ups for Las Vegas Algorithms , 2012, 2013 42nd International Conference on Parallel Processing.

[16]  Pascal Van Hentenryck,et al.  Parallelizing Constraint Programs Transparently , 2007, CP.