Towards ParadisEO-MO-GPU: A Framework for GPU-Based Local Search Metaheuristics
This paper is a major step towards a pioneering software framework for the reusable design and implementation of parallel metaheuristics on Graphics Processing Units (GPU). The objective is to revisit the ParadisEO framework to allow its utilization on GPU accelerators. The focus is on local search metaheuristics and the parallel exploration of their neighborhood. The challenge is to make the GPU as transparent as possible for the user. The first release of the new GPU-based ParadisEO framework has been experimented on the Quadratic Assignment Problem (QAP). The preliminary results are convincing, both in terms of flexibility and easiness of reuse at implementation, and in terms of efficiency at execution on GPU.
KeywordsSoftware Framework Local Search Meta-heuristics Parallel Computing GPU Computing Neighborhood Exploration
Unable to display preview. Download preview PDF.
- 4.Tantar, A.A., Melab, N., Demarey, C., Talbi, E.G.: Building a Virtual Globus Grid in a Reconfigurable Environment - A case study: Grid5000 (2007)Google Scholar
- 7.Luong, T.V., Melab, N., Talbi, E.G.: Parallel hybrid evolutionary algorithms on gpu. In: IEEE Congress on Evolutionary Computation, pp. 1–8 (2010)Google Scholar