Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-10-11
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
We present a parallel algorithm that computes the ask and bid prices of an American option when proportional transaction costs apply to the trading of the underlying asset. The algorithm computes the prices on recombining binomial trees, and is designed for modern multi-core processors. Although parallel option pricing has been well studied, none of the existing approaches takes transaction costs into consideration. The algorithm that we propose partitions a binomial tree into blocks. In any round of computation a block is further partitioned into regions which are assigned to distinct processors. To minimise load imbalance the assignment of nodes to processors is dynamically adjusted before each new round starts. Synchronisation is required both within a round and between two successive rounds. The parallel speedup of the algorithm is proportional to the number of processors used. The parallel algorithm was implemented in C/C++ via POSIX Threads, and was tested on a machine with 8 processors. In the pricing of an American put option, the parallel speedup against an efficient sequential implementation was 5.26 using 8 processors and 1500 time steps, achieving a parallel efficiency of 65.75%.
Roux Alet
Zastawniak Tomasz
Zhang Nan
No associations
LandOfFree
Parallel Binomial American Option Pricing with (and without) Transaction Costs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel Binomial American Option Pricing with (and without) Transaction Costs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Binomial American Option Pricing with (and without) Transaction Costs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-472587