Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results)

DI Group Author

Research output: Contribution to journalArticle


We explore the use of the Cell Broadband Engine 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 This algorithm was chosen because it fits very well the Cell/BE architecture and requires neither shared memory nor communication between processors, while retaining a compact memory footprint. We study the performance on several large optimization benchmarks and show that this achieves mostly linear time speedups, even sometimes super-linear. This is possible because the parallel implementation might explore simultaneously different parts of the search space and therefore converge faster towards the best sub-space and thus towards a solution. Besides getting speedups, the resulting times exhibit a much smaller variance, which benefits applications where a timely reply is critical.
Original languageUnknown
Pages (from-to)97-111
JournalElectronic Proceedings in Theoretical Computer Science
Issue numberNA
Publication statusPublished - 1 Jan 2009

Cite this