Improving Locality for ODE Solvers by Program Transformations

Runge-Kutta methods are popular methods for the solution of ordinary differential equations and implementations are provided by many scientific libraries. The performance of Runge-Kutta methods depends on the specific application problem to be solved, but also on the characteristics of the target ma...

Full description

Bibliographic Details
Main Authors: Thomas Rauber, Gudula Rünger
Format: Article
Language:English
Published: Hindawi Limited 2004-01-01
Series:Scientific Programming
Online Access:http://dx.doi.org/10.1155/2004/175169
id doaj-3f9e8bf6fedb4b58aedba2ba166888f1
record_format Article
spelling doaj-3f9e8bf6fedb4b58aedba2ba166888f12021-07-02T03:25:48ZengHindawi LimitedScientific Programming1058-92441875-919X2004-01-0112313315410.1155/2004/175169Improving Locality for ODE Solvers by Program TransformationsThomas Rauber0Gudula Rünger1Fachgruppe für Informatik, Universität Bayreuth, 95440 Bayreuth, GermanyFakultät für Informatik, Technische Universität Chemnitz, 09107 Chemnitz, GermanyRunge-Kutta methods are popular methods for the solution of ordinary differential equations and implementations are provided by many scientific libraries. The performance of Runge-Kutta methods depends on the specific application problem to be solved, but also on the characteristics of the target machine. For processors with a memory hierarchy, the locality of data referencing pattern has a large impact on the efficiency of a program. In this paper, we describe program transformations for Runge-Kutta methods resulting in implementations with improved locality behavior for systems of ODEs. The transformations are based on properties of the solution method but are independent from the specific application problem or the specific target machine so that the resulting implementation is suitable as library function. We show that the locality improvement leads to performance gains on different recent microprocessors.http://dx.doi.org/10.1155/2004/175169
collection DOAJ
language English
format Article
sources DOAJ
author Thomas Rauber
Gudula Rünger
spellingShingle Thomas Rauber
Gudula Rünger
Improving Locality for ODE Solvers by Program Transformations
Scientific Programming
author_facet Thomas Rauber
Gudula Rünger
author_sort Thomas Rauber
title Improving Locality for ODE Solvers by Program Transformations
title_short Improving Locality for ODE Solvers by Program Transformations
title_full Improving Locality for ODE Solvers by Program Transformations
title_fullStr Improving Locality for ODE Solvers by Program Transformations
title_full_unstemmed Improving Locality for ODE Solvers by Program Transformations
title_sort improving locality for ode solvers by program transformations
publisher Hindawi Limited
series Scientific Programming
issn 1058-9244
1875-919X
publishDate 2004-01-01
description Runge-Kutta methods are popular methods for the solution of ordinary differential equations and implementations are provided by many scientific libraries. The performance of Runge-Kutta methods depends on the specific application problem to be solved, but also on the characteristics of the target machine. For processors with a memory hierarchy, the locality of data referencing pattern has a large impact on the efficiency of a program. In this paper, we describe program transformations for Runge-Kutta methods resulting in implementations with improved locality behavior for systems of ODEs. The transformations are based on properties of the solution method but are independent from the specific application problem or the specific target machine so that the resulting implementation is suitable as library function. We show that the locality improvement leads to performance gains on different recent microprocessors.
url http://dx.doi.org/10.1155/2004/175169
work_keys_str_mv AT thomasrauber improvinglocalityforodesolversbyprogramtransformations
AT gudularunger improvinglocalityforodesolversbyprogramtransformations
_version_ 1721341587063046144