Skip to Main content Skip to Navigation
Conference papers

Automatic Parallelization of a Gap Model using Java and OpenCL

Abstract : Nowadays, scientists are often disappointed by the outcome when parallelizing their simulations, in spite of all the tools at their disposal. They often invest much time and money, and do not obtain the expected speed-up. This can come from many factors going from a wrong parallel architecture choice to a model that simply does not present the criteria to be a good candidate for parallelization. However, when parallelization is successful, the reduced execution time can open new research perspectives, and allow to explore larger sets of parameters of a given simulation model. Thus, it is worth investing some time and workforce to figure out whether an algorithm is a good candidate to parallelization. Automatic parallelization tools can be of great help when trying to identify these properties. In this paper, we apply an automatic parallelization approach combining Java and OpenCL on an existing Gap Model. The two technologies are linked with a library from AMD called Aparapi. The latter allowed us to study the behavior of our automatically parallelized model on 10 different platforms, without modifying the source code.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Jonathan Passerat-Palmbach Connect in order to contact the contributor
Submitted on : Monday, December 22, 2014 - 6:57:58 PM
Last modification on : Saturday, November 20, 2021 - 3:09:20 AM
Long-term archiving on: : Friday, April 14, 2017 - 1:30:05 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : hal-01083187, version 1


Jonathan Passerat-Palmbach, Arthur Forest, Julien Pal, Bruno Corbara, David R.C. Hill. Automatic Parallelization of a Gap Model using Java and OpenCL. European Simulation and Modelling Conference, Oct 2012, Essen, Belgium. pp.24-31. ⟨hal-01083187⟩



Les métriques sont temporairement indisponibles