Targeting the Cell Broadband Engine for constraint-based local search

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 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.
Type de document :
Article dans une revue
Concurrency and Computation: Practice and Experience, Wiley, 2011, 13 p. 〈10.1002/cpe.1855〉
Liste complète des métadonnées

https://hal-paris1.archives-ouvertes.fr/hal-00663776
Contributeur : Daniel Diaz <>
Soumis le : vendredi 27 janvier 2012 - 14:29:10
Dernière modification le : mercredi 21 mars 2018 - 18:57:05

Lien texte intégral

Identifiants

Collections

Citation

Daniel Diaz, Salvador Abreu, Philippe Codognet. Targeting the Cell Broadband Engine for constraint-based local search. Concurrency and Computation: Practice and Experience, Wiley, 2011, 13 p. 〈10.1002/cpe.1855〉. 〈hal-00663776〉

Partager

Métriques

Consultations de la notice

172