Parallel Implementation of Runge–Kutta Integrators with Low Storage Requirements

  • Matthias Korch
  • Thomas Rauber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5704)


This paper considers the parallel solution of large systems of ordinary differential equations (ODEs) which possess a special access pattern by explicit Runge–Kutta (RK) methods. Such systems may arise, for example, from the semi-discretization of partial differential equations (PDEs). We propose an implementation strategy based on a pipelined processing of the stages of the RK method that does not impose restrictions on the choice of coefficients of the RK method. This approach can be implemented with low storage while still allowing efficient step control by embedded solutions.


Parallel Implementation Access Distance Stepsize Control Argument Vector Neighboring Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burrage, K.: Parallel and Sequential Methods for Ordinary Differential Equations. Oxford University Press, New York (1995)zbMATHGoogle Scholar
  2. 2.
    Kennedy, C.A., Carpenter, M.H., Lewis, R.M.: Low-storage, explicit Runge–Kutta schemes for the compressible Navier-Stokes equations. Appl. Numer. Math. 35(3), 177–219 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Calvo, M., Franco, J.M., Rández, L.: Short note: A new minimum storage Runge–Kutta scheme for computational acoustics. J. Comp. Phys. 201(1), 1–12 (2004)CrossRefzbMATHGoogle Scholar
  4. 4.
    Berland, J., Bogey, C., Bailly, C.: Optimized explicit schemes: matching and boundary schemes, and 4th-order Runge–Kutta algorithm. In: 10th AIAA/CEAS Aeroacoustics Conference, pp. 1–34 (2004), AIAA Paper 2004-2814Google Scholar
  5. 5.
    Berland, J., Bogey, C., Bailly, C.: Low-dissipation and low-dispersion fourth-order Runge–Kutta algorithm. Computers & Fluids 35(10), 1459–1463 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Ruuth, S.J.: Global optimization of explicit strong-stability-preserving Runge–Kutta methods. Math. Comp. 75(253), 183–207 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kennedy, C.A., Carpenter, M.H.: Third-order 2N-storage Runge–Kutta schemes with error control. Technical Report NASA TM-109111, National Aeronautics and Space Administration, Langley Research Center, Hampton, VA (1994)Google Scholar
  8. 8.
    Korch, M., Rauber, T.: Scalable parallel RK solvers for ODEs derived by the method of lines. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 830–839. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Korch, M., Rauber, T.: Optimizing locality and scalability of embedded Runge–Kutta solvers using block-based pipelining. J. Par. Distr. Comp. 66(3), 444–468 (2006)CrossRefzbMATHGoogle Scholar
  10. 10.
    Schiesser, W.E.: The Numerical Method of Lines. Academic Press Inc., London (1991)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Matthias Korch
    • 1
  • Thomas Rauber
    • 1
  1. 1.Department of Computer ScienceUniversity of BayreuthGermany

Personalised recommendations