Parallel option price valuations with the explicit finite difference method

Document Type

Article

Publication Date

4-1-2010

Abstract

We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in parallel. Towards this we introduce a latency tolerant parallel algorithm for performing such computations efficiently that achieves optimal theoretical speedup p, where p is the number of processor of the parallel system. An implementation of the parallel algorithm has been undertaken, and an evaluation of its performance is carried out by performing an experimental study on a high-latency PC cluster, and at a smaller scale, on a multi-core processor using in addition the SWARM parallel computing framework for multi-core processors. Our implementation of the parallel algorithm is not only architecture but also communication library independent: the same code works under LAM-MPI and Open MPI and also BSPlib, two sets of library frameworks that facilitate parallel programming. The suitability of our approach to multi-core processors is also established. © Springer Science+Business Media, LLC 2009.

Identifier

77952293479 (Scopus)

Publication Title

International Journal of Parallel Programming

External Full Text Location

https://doi.org/10.1007/s10766-009-0126-5

ISSN

08857458

First Page

159

Last Page

182

Issue

2

Volume

38

Grant

IIS-0324816

This document is currently not available here.

Share

COinS