Skip to Main content Skip to Navigation

Parallelization of the Numerical Lyapunov Calculation for the Fermi-Pasta-Ulam Chain

Abstract : In this paper, we present an efficient and simple solution to the parallelization of discrete integration programs of ordinary differential equations (ODE). The main technique used is known as loop tiling. To avoid the overhead due to code complexity and border effects, we introduce redundant tasks and we use non parallelepiped tiles. Thanks both to cache reuse (x4.3) and coarse granularity (x24.5) , the speedup using 25 processors over the non-tiled sequential implementation is larger than 106. We also present the draft of a fuzzy methodology to optimize the tile size and we illustrate it using real measurements for the communication cost and the execution time. In particular, we observe that the model of communication latencies over a Myrinet network is not as simple as is usually reported. We apply this solution to study the Lyapunov exponents of the Fermi-Pasta-Ulam (FPU) chain and in particular the dependence of the maximum Lyapunov exponents as a function of the length of the chain.
Document type :
Complete list of metadata
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:13:03 AM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM


Files produced by the author(s)


  • HAL Id : hal-02102055, version 1



Fabrice Rastello, Thierry Dauxois. Parallelization of the Numerical Lyapunov Calculation for the Fermi-Pasta-Ulam Chain. [Research Report] LIP RR-2001-42, Laboratoire de l'informatique du parallélisme. 2001, 2+24p. ⟨hal-02102055⟩



Record views


Files downloads