• DocumentCode
    1984821
  • Title

    Diamond-Like Tiling Schemes for Efficient Explicit Euler on GPUs

  • Author

    Korch, Matthias ; Kulbe, Julien ; Scholtes, Carsten

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Bayreuth, Bayreuth, Germany
  • fYear
    2012
  • fDate
    25-29 June 2012
  • Firstpage
    259
  • Lastpage
    266
  • Abstract
    GPU computing offers a high potential of raw processing power at comparatively low costs. This paper investigates optimization techniques for solving initial value problems (IVPs) of ordinary differential equations (ODEs) on GPUs. Different techniques, especially for exploiting the GPU memory hierarchy, are discussed, and corresponding OpenCL implementations of the explicit Euler method are compared using runtime experiments. The results show considerable performance improvements in many situations. Due to the basic character of the explicit Euler method, the results of this investigation can guide the optimization of more complex ODE methods with higher order and better stability on GPUs.
  • Keywords
    differential equations; graphics processing units; initial value problems; optimisation; GPU computing; GPU memory hierarchy; IVP; ODE; OpenCL implementations; diamond-like tiling schemes; explicit Euler; initial value problems; optimization techniques; ordinary differential equations; runtime experiments; Approximation methods; Arrays; Computational modeling; Diamond-like carbon; Graphics processing unit; Memory management; Optimization; GPU computing; explicit Euler method; initial value problems; loop tiling; memory hierarchy; ordinary differential equations; parallelism;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Computing (ISPDC), 2012 11th International Symposium on
  • Conference_Location
    Munich/Garching, Bavaria
  • Print_ISBN
    978-1-4673-2599-8
  • Type

    conf

  • DOI
    10.1109/ISPDC.2012.42
  • Filename
    6341520