Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results)
We explore the use of the Cell Broadband Engine (Cell/BE for short) for combinatorial optimization applications: we present a parallel version of a constraint-based local search algorithm that has been implemented on a multiprocessor BladeCenter machine with twin Cell/BE processors (total of 16...
Main Authors: | Salvator Abreu, Daniel Diaz, Philippe Codognet |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2009-10-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/0910.1264v1 |
Similar Items
-
Solving Constraints for Generational Search
by: Poetzl, D, et al.
Published: (2013) -
Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming
by: Roberto Montemanni, et al.
Published: (2023-01-01) -
Solving Economic Dispatch Problems with Practical Constraints Utilizing Differential Search Algorithm
by: M. H., Sulaiman, et al.
Published: (2013) -
Difficulties in solving non-routine problems: preliminary analysis and results
by: Shawan, Muslimah, et al.
Published: (2021) -
Difficulties in Solving Non-Routine Problems: Preliminary Analysis and Results
by: Muslimah Shawan, et al.
Published: (2021-09-01)