Please use this identifier to cite or link to this item:
|Title: ||Targeting the Cell Broadband Engine for constraint-based local search|
|Authors: ||Diaz, Daniel|
|Issue Date: ||2012|
|Citation: ||Daniel Diaz, Salvador Abreu, Philippe Codognet: Targeting the Cell Broadband Engine for constraint-based local search. Concurrency and Computation: Practice and Experience 24(6): 647-660 (2012)|
|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 bench- marks 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.|
|Appears in Collections:||INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.