pith. sign in

arxiv: 1907.01198 · v1 · pith:234225VKnew · submitted 2019-07-02 · 💻 cs.DC

Asynchronous Parareal Algorithm Applied to European Option Pricing

Qinmeng Zou , Guillaume Gbikpi-Benissan , Frederic Magoules This is my paper

Pith reviewed 2026-05-25 11:03 UTC · model grok-4.3

classification 💻 cs.DC
keywords asynchronous iterationsparareal methodEuropean option pricingparallel computingtime domain decompositionnumerical experimentsfinancial PDE
0
0 comments X

The pith

The asynchronous parareal algorithm applies to European option pricing while reducing idle time on parallel computers.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs an original model of asynchronous iterations inside the parareal time-domain decomposition method. It then uses that model to price European options, a standard parabolic PDE problem in finance. Experiments executed on a parallel supercomputer demonstrate that the asynchronous version delivers performance and efficiency gains. A reader would care because the work shows a concrete way to relax synchronization barriers in parallel time-stepping without changing the target solution.

Core claim

The asynchronous parareal algorithm is applied to European option pricing, and numerical experiments on a parallel supercomputer illustrate the performance and efficiency of this new method.

What carries the argument

Asynchronous iterations inside the parareal method, which let processors advance independently to cut idle time while still solving the same decomposed time problem.

If this is right

  • The method solves the same option-pricing problem as the synchronous parareal version.
  • Idle time is reduced because processors no longer wait for the slowest one at each iteration.
  • Efficiency improves on large parallel machines for time-dependent financial PDEs.
  • Accuracy remains comparable to the classical parareal approach in the reported tests.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same asynchronous model could be tested on American or barrier options whose early-exercise features add nonlinearity.
  • Scalability limits would appear if the number of time slices grows much larger than the number of processors.
  • The approach might combine with other domain-decomposition schemes for multi-asset pricing problems.

Load-bearing premise

Asynchronous iterations converge to the same solution as the synchronous parareal method without introducing instability or accuracy loss.

What would settle it

Numerical runs on identical European option data that produce different prices or fail to converge between the asynchronous and synchronous versions would falsify the claim.

read the original abstract

Asynchronous iterations arise naturally in parallel computing if one wants to solve large problems with a minimization of the idle times. This paper presents an original model of asynchronous iterations for a time-domain decomposition method, namely the parareal method. The asynchronous parareal algorithm is here applied to European option pricing, and numerical experiments performed on a parallel supercomputer, illustrate the performance and efficiency of this new method.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 1 minor

Summary. The manuscript introduces a model of asynchronous iterations for the parareal time-domain decomposition method. It applies the resulting asynchronous parareal algorithm to European option pricing and reports numerical experiments run on a parallel supercomputer that illustrate the method's performance and efficiency.

Significance. If the reported experiments are reproducible, the work provides concrete evidence that asynchronous variants of parareal can reduce idle time on distributed hardware for a standard financial PDE problem. The use of actual supercomputer timings supplies practical validation that is often missing from purely theoretical asynchronous-iteration studies.

minor comments (1)
  1. [Abstract] Abstract: the phrase 'illustrate the performance and efficiency' is vague; a single sentence stating the observed speedup or iteration reduction relative to the synchronous baseline would make the contribution clearer without lengthening the abstract.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript on the asynchronous parareal algorithm for European option pricing and for recommending minor revision. The report highlights the practical value of the supercomputer experiments, which aligns with our goals. As no major comments are listed, we will incorporate any minor suggestions during revision.

Circularity Check

0 steps flagged

No significant circularity; application and experiments are self-contained

full rationale

The paper introduces an asynchronous variant of the parareal method and applies it to European option pricing, with the central support coming from numerical experiments on a parallel supercomputer that illustrate performance. No derivation chain, fitted parameters renamed as predictions, or load-bearing self-citations appear in the abstract or described content. The claims reduce to implementation results rather than any mathematical reduction to inputs by construction, making the work independent of the circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no free parameters, axioms, or invented entities can be extracted.

pith-pipeline@v0.9.0 · 5586 in / 952 out tokens · 14667 ms · 2026-05-25T11:03:09.755048+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    A.-K. C. Ahamed and F. Magoulès. Fast sparse matrix-vect or multiplication on graph- ics processing unit for finite element analysis. In Proceedings of the 14th IEEE In- ternational Conference on High Performance Computing and Comm unications (HPCC 2012), Liverpool, UK, June 25-27, 2012 . IEEE Computer Society, 2012

    work page 2012

  2. [2]

    A.-K. C. Ahamed and F. Magoulès. Iterative methods for sp arse linear systems on graphics processing unit. In Proceedings of the 14th IEEE International Conference on High Performance Computing and Communications (HPCC 2012) , Liverpool, UK, June 25-27, 2012 . IEEE Computer Society, 2012

    work page 2012

  3. [3]

    G. M. Baudet. Asynchronous iterative methods for multip rocessors. J. ACM, 25(2):226– 244, 1978

    work page 1978

  4. [4]

    D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989

    work page 1989

  5. [5]

    Black and M

    F. Black and M. Scholes. The pricing of options and corpor ate liabilities. Journal of Political Economy, 81(3):637–654, 1973

    work page 1973

  6. [6]

    Chazan and W

    D. Chazan and W. Miranker. Chaotic relaxation. Linear Algebra and its Applications , 2(2):199–222, 1969

    work page 1969

  7. [7]

    M. N. El Tarazi. Some convergence results for asynchrono us algorithms. Numerische Mathematik, 39(3):325–340, 1982

    work page 1982

  8. [8]

    Frommer and D

    A. Frommer and D. B. Szyld. Asynchronous two-stage itera tive methods. Numerische Mathematik, 69(2):141–153, 1994

    work page 1994

  9. [9]

    Frommer and D

    A. Frommer and D. B. Szyld. Asynchronous iterations with flexible communication for linear systems. Calculateurs Parallèles , 10:91–103, 1998. 7

    work page 1998

  10. [10]

    Frommer and D

    A. Frommer and D. B. Szyld. On asynchronous iterations. Journal of Computational and Applied Mathematics , 123(1–2):201–216, 2000

    work page 2000

  11. [11]

    M. J. Gander and S. Vandewalle. Analysis of the parareal time-parallel time-integration method. SIAM Journal on Scientific Computing , 29(2):556–578, 2007

    work page 2007

  12. [12]

    Kollias, A

    G. Kollias, A. Y. Grama, and Z. Li. Asynchronous iterati ve algorithms. In D. Padua, editor, Encyclopedia of Parallel Computing , pages 87–95. Springer US, 2011

    work page 2011

  13. [13]

    pararéel

    J.-L. Lions, Y. Maday, and G. Turinici. Résolution d’ED P par un schéma en temps “pararéel”. Comptes rendus de l’Académie des sciences. Série I, Mathémati que, 332(7):661–668, 2001

    work page 2001

  14. [14]

    Magoulès and A.-K

    F. Magoulès and A.-K. C. Ahamed. Alinea: An advanced lin ear algebra library for massively parallel computations on graphics processing un its. The International Journal of High Performance Computing Applications , 29(3):284–310, 2015

    work page 2015

  15. [15]

    Magoulès, A.-K

    F. Magoulès, A.-K. C. Ahamed, and R. Putanowicz. Auto-t uned Krylov methods on cluster of graphics processing unit. International Journal of Computer Mathematics , 92(6):1222–1250, 2015

    work page 2015

  16. [16]

    Magoulès, A.-K

    F. Magoulès, A.-K. C. Ahamed, and R. Putanowicz. Fast it erative solvers for large compressed-sparse row linear systems on graphics processi ng unit. Pollack Periodica , 10(1):3–18, 2015

    work page 2015

  17. [17]

    Magoulès, A.-K

    F. Magoulès, A.-K. C. Ahamed, and R. Putanowicz. Optimi zed Schwarz method with- out overlap for the gravitational potential equation on clu ster of graphics processing unit. International Journal of Computer Mathematics , 93(6):955–980, 2016

    work page 2016

  18. [18]

    Magoulès, A.-K

    F. Magoulès, A.-K. C. Ahamed, and A. Suzuki. Green compu ting on graphics process- ing units. Concurrency and Computation: Practice and Experience , 28(16):4305–4325, 2016

    work page 2016

  19. [19]

    Magoulès and G

    F. Magoulès and G. Gbikpi-Benissan. JACK: an asynchron ous communication kernel library for iterative algorithms. The Journal of Supercomputing , 73(8):3468–3487, 2017

    work page 2017

  20. [20]

    Magoulès, D

    F. Magoulès, D. B. Szyld, and C. Venet. Asynchronous opt imized Schwarz methods with and without overlap. Numerische Mathematik , 137:199–227, 2017

    work page 2017

  21. [21]

    Magoulès and C

    F. Magoulès and C. Venet. Asynchronous iterative sub-s tructuring methods. Mathe- matics and Computers in Simulation , (in press)

    work page

  22. [22]

    R. C. Merton. Theory of rational option pricing. Bell Journal of Economics , 4(1):141– 183, 1973

    work page 1973

  23. [23]

    R. C. Merton. On the pricing of corporate debt: the risk s tructure of interest rates. The Journal of Finance , 29(2):449–470, 1974

    work page 1974

  24. [24]

    J.-C. Miellou. Algorithmes de relaxation chaotique à r etards. ESAIM: Mathematical Modelling and Numerical Analysis , 9(R1):55–82, 1975

    work page 1975

  25. [25]

    Toselli and O

    A. Toselli and O. B. Widlund. Domain Decomposition Methods: Algorithms and The- ory, volume 34 of Springer Series in Computational Mathematics . Springer Berlin Heidelberg, 2005. 8

    work page 2005