Parallel Valuation of the Lower and Upper Bound Prices for Multi-asset Bermudan Options - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Parallel Valuation of the Lower and Upper Bound Prices for Multi-asset Bermudan Options

(1) , (1)
1

Abstract

We present a parallel algorithm and its multi-threaded implementation for computing lower and upper bound prices of multi-asset Bermudan options. Our baseline sequential algorithm follows Longstaff and Schwartz’s least-squares Monte Carlo method in computing the lower bound and Andersen and Broadie’s simulation-based procedure with sub-optimality checking for the upper bound. The parallel implementation uses POSIX Threads for thread manipulation and Intel’s MKL functions for random number generation and linear algebra operations. Tests were made on Intel x86 multi-core processors using the same option examples as the previous work, and the runtimes of the same computations were reduced from minutes to a few seconds.
Fichier principal
Vignette du fichier
978-3-642-35606-3_54_Chapter.pdf (640.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01551362 , version 1 (30-06-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Zhang Nan, Ka Lok Man. Parallel Valuation of the Lower and Upper Bound Prices for Multi-asset Bermudan Options. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.453-462, ⟨10.1007/978-3-642-35606-3_54⟩. ⟨hal-01551362⟩
45 View
114 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More