Computer Science – Artificial Intelligence
Scientific paper
2009-10-07
EPTCS 5, 2009, pp. 97-111
Computer Science
Artificial Intelligence
Scientific paper
10.4204/EPTCS.5.8
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 SPUs per blade). 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.
Abreu Salvator
Codognet Philippe
Diaz Daniel
No associations
LandOfFree
Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36283