Skip to main content

Towards ParadisEO-MO-GPU: A Framework for GPU-Based Local Search Metaheuristics

  • Conference paper
Book cover Advances in Computational Intelligence (IWANN 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6691))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Van Luong, T., Melab, N., Talbi, E.-G.: Local search algorithms on graphics processing units. A case study: The permutation perceptron problem. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 264–275. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Cahon, S., Melab, N., Talbi, E.-G.: ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. J. of Heuristics 10(3), 357–380 (2004)

    Article  MATH  Google Scholar 

  3. Melab, N., Cahon, S., Talbi, E.-G.: Grid computing for parallel bioinspired algorithms. J. Parallel Distributed Computing 66(8), 1052–1061 (2006)

    Article  MATH  Google Scholar 

  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 

  5. Nickolls, J., Buck, I., Garland, M., Skadron, K.: Scalable Parallel Programming with CUDA. ACM Queue 6(2), 40–53 (2008)

    Article  Google Scholar 

  6. Taillard, É.D.: Robust tabu search for the quadratic assignment problem. Parallel Computing 17(4-5), 443–455 (1991)

    Article  MathSciNet  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Melab, N., Luong, T.V., Boufaras, K., Talbi, E.G. (2011). Towards ParadisEO-MO-GPU: A Framework for GPU-Based Local Search Metaheuristics. In: Cabestany, J., Rojas, I., Joya, G. (eds) Advances in Computational Intelligence. IWANN 2011. Lecture Notes in Computer Science, vol 6691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21501-8_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21501-8_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21500-1

  • Online ISBN: 978-3-642-21501-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics