Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture

Abstract : We investigate the use of the Cell Broadband Engine (Cell/BE) for Combinatorial Optimization applications. We present a parallel version of a constraint-based Local Search algorithm which was chosen because it fits very well the Cell/BE architecture since it requires neither shared memory nor communication between processors. The performance study on several large optimization benchmarks shows mostly linear time speedups, even sometimes super-linear. These experiments were done on a Dual-Cell IBM Blade with 16 processors. Besides getting speedups, the execution times exhibit a much smaller variance, which benefits applications where a timely reply is critical.
Type de document :
Communication dans un congrès
IDC 2010 - 4th International Symposium on Intelligent Distributed Computing, Sep 2010, Tangier, Morocco. 315, pp.265-274, 2010, Studies in Computational Intelligence. 〈10.1007/978-3-642-15211-5_28〉
Liste complète des métadonnées

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

Lien texte intégral

Identifiants

Collections

Citation

Daniel Diaz, Salvador Abreu, Philippe Codognet. Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture. IDC 2010 - 4th International Symposium on Intelligent Distributed Computing, Sep 2010, Tangier, Morocco. 315, pp.265-274, 2010, Studies in Computational Intelligence. 〈10.1007/978-3-642-15211-5_28〉. 〈hal-00663816〉

Partager

Métriques

Consultations de la notice

124