2923

Acceleration of Binomial Options Pricing via Parallelizing along time-axis on a GPU

Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhler
Dept. of Comp. Sci. and Engg, Washington University in St. Louis
Symposium on Application Accelerators in High Performance Computing, 2009 (SAAHPC’09)

@article{ganesan2009acceleration,

   title={Acceleration of Binomial Options Pricing via Parallelizing along time-axis on a GPU},

   author={Ganesan, N. and Chamberlain, R.D. and Buhler, J.},

   journal={Performance Computing},

   year={2009}

}

Download Download (PDF)   View View   Source Source   

928

views

Since the introduction of organized trading of options for commodities and equities, computing fair prices for options has been an important problem in financial engineering. A variety of numerical methods, including Monte Carlo methods, binomial trees, and numerical solution of stochastic differential equations, are used to compute fair prices. Traders and brokerage firms constantly strive to achieve faster calculation of option prices because timely information can mean the difference between a deal struck or missed, which translates to substantial profit or loss. Hence, the latency to compute a fair option price plays an important role in short-term trading and arbitrage. Financial firms constantly seek faster, more accurate option pricing methods in order to keep up with or ahead of their competitors. Approaches to improve latency include both more efficient trading strategies or pricing algorithms and use of specialized, high-performance computer architectures, such as FPGAs, many-core CPUs, and GPUs. An exemplary low-latency implementation on FPGA of European Options pricing via Monte-Carlo simulation was described in [1], where 15x speedup over an existing server, as well as outperforming a GPU and Cell implementation was reported. Monte-Carlo methods are usually exhaustive, time and compute intensive and take into consideration various sources of uncertainties corresponding to real market conditions. On the other hand, lattice(esp. binomial tree) methods are faster and consider relatively few possibilities, uncertainties and is a reasonable approximation to a variety of standard market conditions.
No votes yet.
Please wait...

* * *

* * *

Featured events

2018
November
27-30
Hida Takayama, Japan

The Third International Workshop on GPU Computing and AI (GCA), 2018

2018
September
19-21
Nagoya University, Japan

The 5th International Conference on Power and Energy Systems Engineering (CPESE), 2018

2018
September
22-24
MediaCityUK, Salford Quays, Greater Manchester, England

The 10th International Conference on Information Management and Engineering (ICIME), 2018

2018
August
21-23
No. 1037, Luoyu Road, Hongshan District, Wuhan, China

The 4th International Conference on Control Science and Systems Engineering (ICCSSE), 2018

2018
October
29-31
Nanyang Executive Centre in Nanyang Technological University, Singapore

The 2018 International Conference on Cloud Computing and Internet of Things (CCIOT’18), 2018

HGPU group © 2010-2018 hgpu.org

All rights belong to the respective authors

Contact us: