Targeting the Cell Broadband Engine for constraint-based local search

SUMMARY 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 becaus...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and Computation: Practice and Experience Vol. 24; no. 6; pp. 647 - 660
Main Authors: Diaz, Daniel, Abreu, Salvador, Codognet, Philippe
Format: Journal Article
Language:English
Published: Chichester, UK John Wiley & Sons, Ltd 25.04.2012
Wiley
Subjects:
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Cell/BE
Computer Science
constraint satisfaction
local search
parallel programming
Software Engineering
constraint satisfaction
local search
Cell/BE
parallel programming
ISSN:1532-0626, 1532-0634
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:SUMMARY 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.
Bibliography:istex:E3B33F81FDCE9E529AE0896998484041266F5668
ark:/67375/WNG-FW3M0KHT-W
ArticleID:CPE1855
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.1855