Trinomial-tree based parallel option price valuations

Document Type

Article

Publication Date

12-1-2003

Abstract

We examine how trinomial-tree based computations such as those involved in American or European-style option price valuations can be performed in parallel. Towards this we introduce a parallel algorithm for performing such computations on trinomial trees. The algorithm is described and analyzed in an architecture independent setting and achieves optimal theoretical speedup O(p) and is thus within a 1 + o(1) multiplicative factor of the corresponding sequential method. We verify the practicality and plausibility of the designed algorithm by carrying out an experimental study of an implementation of the algorithm on a high-latency parallel system, a cluster of PC workstations. The algorithmic and programming methodology used to design and analyze the algorithm allows its implementation to work with only recompilation of the source code under two parallel programming libraries: MPI (LAM-MPI) and BSPlib thus making the implementation not only architecture but also communication-library independent.

Identifier

0348011350 (Scopus)

Publication Title

Parallel Algorithms and Applications

External Full Text Location

https://doi.org/10.1080/10637190310001633655

ISSN

10637192

First Page

181

Last Page

196

Issue

4

Volume

18

Grant

9977508

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS