Option pricing with multi-dimensional quadrature architectures
Department of Computing, Imperial College London, London, England, UK
International Conference on Field-Programmable Technology, 2009. FPT 2009
@inproceedings{tse2009option,
title={Option pricing with multi-dimensional quadrature architectures},
author={Tse, A.H.T. and Thomas, D.B. and Luk, W.},
booktitle={Field-Programmable Technology, 2009. FPT 2009. International Conference on},
pages={427–430},
year={2009},
organization={IEEE}
}
Quadrature based methods for numerical integration provide a means of quickly and accurately pricing financial products such as options. These methods can be applied to multi-dimensional products, such as options on multiple underlying assets, but suffer from an exponential increase in computational complexity as the dimension increases. This paper examines the theoretical complexity of quadrature methods for pricing multi-dimensional options, and then relates this to practical performance in contemporary hardware. An automated system for generating hardware architectures for quadrature is used to explore the performance of increasing dimensionality in FPGA implementations, and then compared them to GPU and CPU solutions. We find that a single-precision FPGA can provide 25 times speedup over software in three dimensions, and offers slightly improved performance over a GPU using comparable technology. The latest GPUs are 2.7 times faster than the older technology Virtex-4 FPGA, but the FPGA still provides over 9 times the energy efficiency.
July 14, 2011 by hgpu
