https://hal.inria.fr/hal-01551362Nan, ZhangZhangNanXi'an Jiaotong-Liverpool University [Suzhou]Man, KaKaManXi'an Jiaotong-Liverpool University [Suzhou]Parallel Valuation of the Lower and Upper Bound Prices for Multi-asset Bermudan OptionsHAL CCSD2012Parallel computingoption pricingmulti-asset Bermudan optionsMonte Carlo simulation[INFO] Computer Science [cs]Ifip, HalJames J. ParkAlbert ZomayaSang-Soo YeoSartaj Sahni2017-06-30 10:36:102021-04-28 16:36:022017-06-30 10:37:54enConference papershttps://hal.inria.fr/hal-01551362/document10.1007/978-3-642-35606-3_54application/pdf1We 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.