EXPLOITING LIMITED ACCESS DISTANCE OF ODE SYSTEMS FOR PARALLELISM AND LOCALITY IN EXPLICIT METHODS

The solution of initial value problems of large systems of ordinary differential equations (ODEs) is computationally intensive and demands for efficient parallel solution techniques that take into account the complex architectures of modern parallel computer systems. This article discusses implementation techniques suitable for ODE systems with a special coupling structure, called broiled access distance, which typically arises from the discrotization of systems of partial differential equations (PDEs) by the method of lines. It describes how these techniques can be applied to different explicit ODE methods, namely embedded Runge-Kutta (RK) methods, iterated RE methods, extrapolation met hods, and Adams-Bashforth (AB) methods. Runtime experiments performed on parallel computer systems with different architectures show that these techniques can significantly improve runtime and scalability. By example of Euler's method it is demonstrated that these techniques can also be applied to devise high-performance GPU implementations.