Targeting the Cell Broadband Engine for constraint-based local search

Authors:
Daniel Diaz;Salvador Abreu;Philippe Codognet
Affiliations:
University of Paris 1-Sorbonne, Paris, France;Universidade de Évora and CENTRIA, Évora, Portugal;JFLI, CNRS/UPMC/University of Tokyo, Tokyo, Japan
Venue:
Concurrency and Computation: Practice & Experience
Year:
2012

Citing 20
Cited 0

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
Parallel logic programming systems

ACM Computing Surveys (CSUR)
Introduction to the Special Issue on Parallel Meta-Heuristics

Journal of Heuristics
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Yet Another Local Search Method for Constraint Solving

SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP

IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Search Procedures and Parallelism in Constraint Programming

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CSPLIB: A Benchmark Library for Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Cooperative Parallel Variable Neighborhood Search for the p-Median

Journal of Heuristics
Musical constraint satisfaction problems solved with adaptive search

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Constraint-Based Local Search

Constraint-Based Local Search
The Design of a Multicore Extension of the SPIN Model Checker

IEEE Transactions on Software Engineering
Programming the Cell Broadband Engine Architecture: Examples and Best Practices

Programming the Cell Broadband Engine Architecture: Examples and Best Practices
Parallel and distributed local search in COMET

Computers and Operations Research
c-sat: A Parallel SAT Solver for Clusters

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Parallelizing constraint programs transparently

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Dialectic search

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

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigated the use of the Cell Broadband Engine (Cell/BE) for constraint-based local search and combinatorial optimization applications. We presented a parallel version of a constraint-based local search algorithm that was chosen because it fits very well the Cell/BE architecture because it requires neither shared memory nor communication among processors. The performance study on several large optimization benchmarks shows mostly linear time speedups, sometimes even super linear. These experiments were carried out on a dual-Cell IBM (Armonk, NY, USA) blade with 16 processors. Besides getting speedups, the execution times exhibit a much smaller variance that benefits applications where a timely reply is critical. Copyright © 2011 John Wiley & Sons, Ltd.